Saved in:
| Main Authors: | Ding, Rundong, He, Yiyun, Zhu, Yizhe |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2602.01607 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Minimax optimal submatrix detection: Sharp non-asymptotic rates
by: Knight, Parker, et al.
Published: (2026)
by: Knight, Parker, et al.
Published: (2026)
Online Differentially Private Synthetic Data Generation
by: He, Yiyun, et al.
Published: (2024)
by: He, Yiyun, et al.
Published: (2024)
Non-convex matrix sensing: Breaking the quadratic rank barrier in the sample complexity
by: Stöger, Dominik, et al.
Published: (2024)
by: Stöger, Dominik, et al.
Published: (2024)
On Instability of Minimax Optimal Optimism-Based Bandit Algorithms
by: Praharaj, Samya, et al.
Published: (2025)
by: Praharaj, Samya, et al.
Published: (2025)
Minimax Hypothesis Testing for the Bradley-Terry-Luce Model
by: Makur, Anuran, et al.
Published: (2024)
by: Makur, Anuran, et al.
Published: (2024)
Minimax Optimality of the Probability Flow ODE for Diffusion Models
by: Cai, Changxiao, et al.
Published: (2025)
by: Cai, Changxiao, et al.
Published: (2025)
Minimax Optimality of Score-based Diffusion Models: Beyond the Density Lower Bound Assumptions
by: Zhang, Kaihong, et al.
Published: (2024)
by: Zhang, Kaihong, et al.
Published: (2024)
Minimax-Optimal Reward-Agnostic Exploration in Reinforcement Learning
by: Li, Gen, et al.
Published: (2023)
by: Li, Gen, et al.
Published: (2023)
Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis
by: Li, Gen, et al.
Published: (2021)
by: Li, Gen, et al.
Published: (2021)
Differentially Private Low-dimensional Synthetic Data from High-dimensional Datasets
by: He, Yiyun, et al.
Published: (2023)
by: He, Yiyun, et al.
Published: (2023)
Minimax Optimal Algorithms with Fixed-$k$-Nearest Neighbors
by: Ryu, J. Jon, et al.
Published: (2022)
by: Ryu, J. Jon, et al.
Published: (2022)
Minimax-optimal and Locally-adaptive Online Nonparametric Regression
by: Liautaud, Paul, et al.
Published: (2024)
by: Liautaud, Paul, et al.
Published: (2024)
Minimax optimal transfer learning for high-dimensional additive regression
by: Moon, Seung Hyun
Published: (2025)
by: Moon, Seung Hyun
Published: (2025)
Minimax-optimal trust-aware multi-armed bandits
by: Cai, Changxiao, et al.
Published: (2024)
by: Cai, Changxiao, et al.
Published: (2024)
The importance of feature preprocessing for differentially private linear optimization
by: Sun, Ziteng, et al.
Published: (2023)
by: Sun, Ziteng, et al.
Published: (2023)
Fundamental limits of distributed covariance matrix estimation via a conditional strong data processing inequality
by: Rahmani, Mohammad Reza, et al.
Published: (2025)
by: Rahmani, Mohammad Reza, et al.
Published: (2025)
Maximum entropy based testing in network models: ERGMs and constrained optimization
by: Ghosh, Subhro, et al.
Published: (2026)
by: Ghosh, Subhro, et al.
Published: (2026)
Sparse Hanson-Wright Inequalities with Applications
by: He, Yiyun, et al.
Published: (2024)
by: He, Yiyun, et al.
Published: (2024)
Information-Geometric Decomposition of Generalization Error in Unsupervised Learning
by: Kim, Gilhan
Published: (2026)
by: Kim, Gilhan
Published: (2026)
Minimax Semiparametric Learning With Approximate Sparsity
by: Bradic, Jelena, et al.
Published: (2019)
by: Bradic, Jelena, et al.
Published: (2019)
Learning from Biased and Costly Data Sources: Minimax-optimal Data Collection under a Budget
by: Harding, Michael O., et al.
Published: (2026)
by: Harding, Michael O., et al.
Published: (2026)
Testing properties of trees in graphical models with covariance queries
by: Burova, Sofiya, et al.
Published: (2026)
by: Burova, Sofiya, et al.
Published: (2026)
Efficient Sampling with Discrete Diffusion Models: Sharp and Adaptive Guarantees
by: Dmitriev, Daniil, et al.
Published: (2026)
by: Dmitriev, Daniil, et al.
Published: (2026)
Sample efficient inductive matrix completion with noise and inexact side information
by: Yang, Yuepeng, et al.
Published: (2026)
by: Yang, Yuepeng, et al.
Published: (2026)
Decoupled Descent: Exact Test Error Tracking Via Approximate Message Passing
by: Lovig, Max
Published: (2026)
by: Lovig, Max
Published: (2026)
Order-Optimal Sequential 1-Bit Mean Estimation in General Tail Regimes
by: Lau, Ivan, et al.
Published: (2026)
by: Lau, Ivan, et al.
Published: (2026)
Diffusion Models Are Statistically Optimal for Learning Low-Dimensional Multi-Modal Distributions
by: Wu, Jingda, et al.
Published: (2026)
by: Wu, Jingda, et al.
Published: (2026)
Breaking the Finite-Sample Barrier in Entropy Coupling
by: Asoodeh, Shahab, et al.
Published: (2026)
by: Asoodeh, Shahab, et al.
Published: (2026)
Orthogonal Approximate Message Passing Algorithms for Rectangular Spiked Matrix Models with Rotationally Invariant Noise
by: Chen, Haohua, et al.
Published: (2026)
by: Chen, Haohua, et al.
Published: (2026)
Accurate Evaluation of Quickest Changepoint Detectors via Non-parametric Survival Analysis
by: Miyagawa, Taiki, et al.
Published: (2026)
by: Miyagawa, Taiki, et al.
Published: (2026)
Adaptation to Intrinsic Dependence in Diffusion Language Models
by: Zhao, Yunxiao, et al.
Published: (2026)
by: Zhao, Yunxiao, et al.
Published: (2026)
Optimal training-conditional regret for online conformal prediction
by: Liang, Jiadong, et al.
Published: (2026)
by: Liang, Jiadong, et al.
Published: (2026)
Thompson sampling: Precise arm-pull dynamics and adaptive inference
by: Han, Qiyang
Published: (2026)
by: Han, Qiyang
Published: (2026)
On the Nonasymptotic Scaling Guarantee of Hyperparameter Estimation in Inhomogeneous, Weakly-Dependent Complex Network Dynamical Systems
by: Yu, Yi, et al.
Published: (2026)
by: Yu, Yi, et al.
Published: (2026)
Instance-Optimal Estimation with Multiple LLM Judges on a Budget
by: Lee, Junghyun, et al.
Published: (2026)
by: Lee, Junghyun, et al.
Published: (2026)
On Observation Time for Recovering Latent Hawkes Networks
by: Linkerhägner, Jonas, et al.
Published: (2026)
by: Linkerhägner, Jonas, et al.
Published: (2026)
Price of Quality: Sufficient Conditions for Sparse Recovery using Mixed-Quality Data
by: Chaabouni, Youssef, et al.
Published: (2026)
by: Chaabouni, Youssef, et al.
Published: (2026)
On the Sample Complexity of Robust Binary Hypothesis Testing
by: Vallinayagam, Shankar, et al.
Published: (2026)
by: Vallinayagam, Shankar, et al.
Published: (2026)
Fine-Grained Uncertainty Quantification via Collisions
by: Friedbaum, Jesse, et al.
Published: (2024)
by: Friedbaum, Jesse, et al.
Published: (2024)
Statistical-Computational Trade-offs in Tensor PCA and Related Problems via Communication Complexity
by: Dudeja, Rishabh, et al.
Published: (2022)
by: Dudeja, Rishabh, et al.
Published: (2022)
Similar Items
-
Minimax optimal submatrix detection: Sharp non-asymptotic rates
by: Knight, Parker, et al.
Published: (2026) -
Online Differentially Private Synthetic Data Generation
by: He, Yiyun, et al.
Published: (2024) -
Non-convex matrix sensing: Breaking the quadratic rank barrier in the sample complexity
by: Stöger, Dominik, et al.
Published: (2024) -
On Instability of Minimax Optimal Optimism-Based Bandit Algorithms
by: Praharaj, Samya, et al.
Published: (2025) -
Minimax Hypothesis Testing for the Bradley-Terry-Luce Model
by: Makur, Anuran, et al.
Published: (2024)