Skip to main content

🏢 Texas A&M University

Single-Loop Stochastic Algorithms for Difference of Max-Structured Weakly Convex Functions
·1750 words·9 mins· loading · loading
AI Generated Machine Learning Optimization 🏢 Texas A&M University
SMAG, a novel single-loop stochastic algorithm, achieves state-of-the-art convergence for solving non-smooth non-convex optimization problems involving differences of max-structured weakly convex func…
Segmenting Watermarked Texts From Language Models
·2577 words·13 mins· loading · loading
AI Generated Natural Language Processing Large Language Models 🏢 Texas A&M University
This paper presents novel statistical methods to reliably watermark and segment LLMs-generated text, ensuring source traceability even after user modifications.
Invariant Tokenization of Crystalline Materials for Language Model Enabled Generation
·2045 words·10 mins· loading · loading
Natural Language Processing Large Language Models 🏢 Texas A&M University
Mat2Seq revolutionizes crystal structure generation using language models by creating unique, invariant 1D sequences from 3D crystal structures, enabling accurate and efficient crystal discovery with …
Gradient Rewiring for Editable Graph Neural Network Training
·2108 words·10 mins· loading · loading
Machine Learning Deep Learning 🏢 Texas A&M University
Gradient Rewiring (GRE) improves editable GNN training by addressing gradient inconsistencies, preserving training node performance while correcting target node errors.
Equivariant Blurring Diffusion for Hierarchical Molecular Conformer Generation
·2848 words·14 mins· loading · loading
Machine Learning Deep Learning 🏢 Texas A&M University
Equivariant Blurring Diffusion (EBD) generates 3D molecular conformers hierarchically, first creating coarse-grained fragments then refining atomic details, significantly outperforming existing method…
Discretely beyond $1/e$: Guided Combinatorial Algortihms for Submodular Maximization
·3091 words·15 mins· loading · loading
AI Generated AI Theory Optimization 🏢 Texas A&M University
Researchers surpass the 1/e barrier in submodular maximization with novel combinatorial algorithms!
Communication-Efficient Federated Group Distributionally Robust Optimization
·1930 words·10 mins· loading · loading
Machine Learning Federated Learning 🏢 Texas A&M University
Communication-efficient algorithms for federated group distributionally robust optimization (FGDRO) are introduced, achieving lower communication complexity and superior performance on real-world task…
A Pairwise Pseudo-likelihood Approach for Matrix Completion with Informative Missingness
·1982 words·10 mins· loading · loading
🏢 Texas A&M University
New method recovers low-rank matrices with informative missingness, offering robust, near-optimal performance.