Imagen de Portada

ShakyPrepend: A Multi-Group Learner with Improved Sample Complexity

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Zhang, Lujing, Hsu, Daniel, Balakrishnan, Sivaraman
Formato:	Preprint
Publicado:	2026
Materias:	Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Panprediction: Optimal Predictions for Any Downstream Task and Loss
por: Balakrishnan, Sivaraman, et al.
Publicado: (2025)

Stability Bounds for Smooth Optimal Transport Maps and their Statistical Implications
por: Balakrishnan, Sivaraman, et al.
Publicado: (2025)

Fair Risk Control: A Generalized Framework for Calibrating Multi-group Fairness Risks
por: Zhang, Lujing, et al.
Publicado: (2024)

Statistical Inference for Optimal Transport Maps: Recent Advances and Perspectives
por: Balakrishnan, Sivaraman, et al.
Publicado: (2025)

Multi-group Learning for Hierarchical Groups
por: Deng, Samuel, et al.
Publicado: (2024)

The Fundamental Limits of Structure-Agnostic Functional Estimation
por: Balakrishnan, Sivaraman, et al.
Publicado: (2023)

On Robust Hypothesis Testing with respect to the Hellinger Distance
por: Modak, Eeshan, et al.
Publicado: (2025)

Hierarchical Token Prepending: Enhancing Information Flow in Decoder-based LLM Embeddings
por: Ding, Xueying, et al.
Publicado: (2025)

Semi-Supervised U-statistics
por: Kim, Ilmun, et al.
Publicado: (2024)

A One-Inclusion Graph Approach to Multi-Group Learning
por: Bergam, Noah, et al.
Publicado: (2026)

Plugin Estimation of Smooth Optimal Transport Maps
por: Manole, Tudor, et al.
Publicado: (2021)

Back to Blackwell: Closing the Loop on Intransitivity in Multi-Objective Preference Fine-Tuning
por: Zhang, Jiahao, et al.
Publicado: (2026)

Double Cross-fit Doubly Robust Estimators: Beyond Series Regression
por: McClean, Alec, et al.
Publicado: (2024)

Sample Complexity of Probability Divergences under Group Symmetry
por: Chen, Ziyu, et al.
Publicado: (2023)

When Can Proxies Improve the Sample Complexity of Preference Learning?
por: Zhu, Yuchen, et al.
Publicado: (2024)

BaCon: Boosting Imbalanced Semi-supervised Learning via Balanced Feature-Level Contrastive Learning
por: Feng, Qianhan, et al.
Publicado: (2024)

Fused Lasso Improves Accuracy of Co-occurrence Network Inference in Grouped Samples
por: Agyapong, Daniel, et al.
Publicado: (2025)

Improved Sample Complexity of Imitation Learning for Barrier Model Predictive Control
por: Pfrommer, Daniel, et al.
Publicado: (2024)

Test-Time Training Provably Improves Transformers as In-context Learners
por: Gozeten, Halil Alperen, et al.
Publicado: (2025)

On Nonasymptotic Confidence Intervals for Treatment Effects in Randomized Experiments
por: Sandoval, Ricardo J., et al.
Publicado: (2026)

Complex Equation Learner: Rational Symbolic Regression with Gradient Descent in Complex Domain
por: Garmaev, Sergei, et al.
Publicado: (2026)

Group-realizable multi-group learning by minimizing empirical risk
por: Ardeshir, Navid, et al.
Publicado: (2026)

CoT Information: Improved Sample Complexity under Chain-of-Thought Supervision
por: Altabaa, Awni, et al.
Publicado: (2025)

Learning Gaussian Multi-Index Models with Gradient Flow: Time Complexity and Directional Convergence
por: Şimşek, Berfin, et al.
Publicado: (2024)

Improving the Reconstruction of Disentangled Representation Learners via Multi-Stage Modeling
por: Srivastava, Akash, et al.
Publicado: (2020)

QTabGAN: A Hybrid Quantum-Classical GAN for Tabular Data Synthesis
por: Kumari, Subhangi, et al.
Publicado: (2026)

Deciphering diffuse scattering with machine learning and the equivariant foundation model: The case of molten FeO
por: Sivaraman, Ganesh, et al.
Publicado: (2024)

Online Learning with Improving Agents: Multiclass, Budgeted Agents and Bandit Learners
por: Ashkezari, Sajad, et al.
Publicado: (2026)

Sampling Complexity of TD and PPO in RKHS
por: Zou, Lu, et al.
Publicado: (2025)

RL in Markov Games with Independent Function Approximation: Improved Sample Complexity Bound under the Local Access Model
por: Fan, Junyi, et al.
Publicado: (2024)

Improved Sample Complexity for Private Nonsmooth Nonconvex Optimization
por: Kornowski, Guy, et al.
Publicado: (2024)

Statistical-Computational Trade-offs in Tensor PCA and Related Problems via Communication Complexity
por: Dudeja, Rishabh, et al.
Publicado: (2022)

Lower bounds for one-layer transformers that compute parity
por: Hsu, Daniel
Publicado: (2026)

The Sample Complexity of Uniform Approximation for Multi-Dimensional CDFs and Fixed-Price Mechanisms
por: Castiglioni, Matteo, et al.
Publicado: (2026)

Settling the Sample Complexity of Online Reinforcement Learning
por: Zhang, Zihan, et al.
Publicado: (2023)

Group-wise oracle-efficient algorithms for online multi-group learning
por: Deng, Samuel, et al.
Publicado: (2024)

Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity
por: Arnob, Samin Yeasar, et al.
Publicado: (2025)

Token Sample Complexity of Attention
por: Bohbot, Léa, et al.
Publicado: (2025)

Are Sparse Neural Networks Better Hard Sample Learners?
por: Xiao, Qiao, et al.
Publicado: (2024)

Finite-Time Convergence and Sample Complexity of Actor-Critic Multi-Objective Reinforcement Learning
por: Zhou, Tianchen, et al.
Publicado: (2024)