:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Saurav, Kumar, Shroff, Ness B., Liang, Yingbin
Format:	Preprint
Published:	2025
Subjects:	Machine Learning Information Theory
Online Access:	https://arxiv.org/abs/2510.22327
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Near-Optimal Partially Observable Reinforcement Learning with Partial Online State Information
by: Shi, Ming, et al.
Published: (2023)

From Scores to Gibbs Correctors: Accelerating Uniform-Rate Discrete Diffusion Models
by: Liang, Yuchen, et al.
Published: (2026)

Absorb and Converge: Provable Convergence Guarantee for Absorbing Discrete Diffusion Models
by: Liang, Yuchen, et al.
Published: (2025)

Online Learning for Optimizing AoI-Energy Tradeoff under Unknown Channel Statistics
by: Abd-Elmagid, Mohamed A., et al.
Published: (2025)

Theory on Score-Mismatched Diffusion Models and Zero-Shot Conditional Samplers
by: Liang, Yuchen, et al.
Published: (2024)

Sharp Convergence Rates for Masked Diffusion Models
by: Liang, Yuchen, et al.
Published: (2026)

Discrete Diffusion Models: Novel Analysis and New Sampler Guarantees
by: Liang, Yuchen, et al.
Published: (2025)

Broadening Target Distributions for Accelerated Diffusion Models via a Novel Analysis Approach
by: Liang, Yuchen, et al.
Published: (2024)

Regret Bounds for Reinforcement Learning from Multi-Source Imperfect Preferences
by: Shi, Ming, et al.
Published: (2026)

Beyond Freshness and Semantics: A Coupon-Collector Framework for Effective Status Updates
by: Ahmed, Youssef, et al.
Published: (2026)

Mixture-of-Transformers Learn Faster: A Theoretical Study on Classification Problems
by: Li, Hongbo, et al.
Published: (2025)

Can We Theoretically Quantify the Impacts of Local Updates on the Generalization Performance of Federated Learning?
by: Ju, Peizhong, et al.
Published: (2024)

Constraint-Rectified Training for Efficient Chain-of-Thought
by: Wu, Qinhang, et al.
Published: (2026)

Theory on Mixture-of-Experts in Continual Learning
by: Li, Hongbo, et al.
Published: (2024)

Learnable Chernoff Baselines for Inference-Time Alignment
by: Madhow, Sunil, et al.
Published: (2026)

Transformers Provably Learn Directed Acyclic Graphs via Kernel-Guided Mutual Information
by: Cheng, Yuan, et al.
Published: (2025)

Unlocking the Power of Rehearsal in Continual Learning: A Theoretical Perspective
by: Deng, Junze, et al.
Published: (2025)

Multi-head Transformers Provably Learn Symbolic Multi-step Reasoning via Gradient Descent
by: Yang, Tong, et al.
Published: (2025)

In-Context Learning with Representations: Contextual Generalization of Trained Transformers
by: Yang, Tong, et al.
Published: (2024)

Balancing Queueing and Retransmission: Latency-Optimal Massive MIMO Design
by: Du, Xu, et al.
Published: (2019)

Exponential convergence rate for Iterative Markovian Fitting
by: Sokolov, Kirill, et al.
Published: (2025)

Delay-Optimal Transmission Scheduling Policies for Time-Correlated Fading Channels
by: Dutta, Manali, et al.
Published: (2025)

Asymptotic Analysis of Sample-averaged Q-learning
by: Panda, Saunak Kumar, et al.
Published: (2024)

Cost Minimization for Space-Air-Ground Integrated Multi-Access Edge Computing Systems
by: Qin, Weihong, et al.
Published: (2025)

On Cost-Aware Sequential Hypothesis Testing with Random Costs and Action Cancellation
by: Vershinin, George, et al.
Published: (2025)

Characterizing Dependence of Samples along the Langevin Dynamics and Algorithms via Contraction of $Φ$-Mutual Information
by: Liang, Jiaming, et al.
Published: (2024)

Just Wing It: Near-Optimal Estimation of Missing Mass in a Markovian Sequence
by: Pananjady, Ashwin, et al.
Published: (2024)

An LP-based Sampling Policy for Multi-Armed Bandits with Side-Observations and Stochastic Availability
by: Soni, Ashutosh, et al.
Published: (2026)

Minimal Communication-Cost Statistical Learning
by: Sefidgaran, Milad, et al.
Published: (2024)

Provably Efficient Multi-Objective Bandit Algorithms under Preference-Centric Customization
by: Cao, Linfeng, et al.
Published: (2025)

How to Find the Exact Pareto Front for Multi-Objective MDPs?
by: Li, Yining, et al.
Published: (2024)

Cost-Aware Optimal Pairwise Pure Exploration
by: Wu, Di, et al.
Published: (2025)

The Geometric Cost of Normalization: Affine Bounds on the Bayesian Complexity of Neural Networks
by: Chun, Sungbae
Published: (2026)

Information-Theoretic Proofs for Diffusion Sampling
by: Reeves, Galen, et al.
Published: (2025)

Agnostic Sample Compression Schemes for Regression
by: Attias, Idan, et al.
Published: (2018)

Generative AI-Driven Phase Control for RIS-Aided Cell-Free Massive MIMO Systems
by: Patel, Kalpesh K., et al.
Published: (2026)

Block-Sample MAC-Bayes Generalization Bounds
by: Frey, Matthias, et al.
Published: (2026)

Information-Theoretic Progress Measures reveal Grokking is an Emergent Phase Transition
by: Clauw, Kenzo, et al.
Published: (2024)

Breaking the Finite-Sample Barrier in Entropy Coupling
by: Asoodeh, Shahab, et al.
Published: (2026)

The Sample Complexity of Simple Binary Hypothesis Testing
by: Pensia, Ankit, et al.
Published: (2024)