:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Aliakbarpour, Maryam, Braverman, Vladimir, Liu, Yuhan, Yin, Junze
Format:	Preprint
Published:	2026
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2602.20698
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Support Basis: Fast Attention Beyond Bounded Entries
by: Aliakbarpour, Maryam, et al.
Published: (2025)

Adversarially robust quantum state learning and testing
by: Aliakbarpour, Maryam, et al.
Published: (2025)

CoVE: Compressed Vocabulary Expansion Makes Better LLM-based Recommender Systems
by: Zhang, Haochen, et al.
Published: (2025)

Auditing Information Disclosure During LLM-Scale Gradient Descent Using Gradient Uniqueness
by: Abdelghafar, Sleem, et al.
Published: (2025)

Optimal Prediction-Augmented Algorithms for Testing Independence of Distributions
by: Aliakbarpour, Maryam, et al.
Published: (2026)

High-Probability Bounds For Heterogeneous Local Differential Privacy
by: Aliakbarpour, Maryam, et al.
Published: (2025)

Breaking the Frozen Subspace: Importance Sampling for Low-Rank Optimization in LLM Pretraining
by: Zhang, Haochen, et al.
Published: (2025)

Optimal Algorithms for Augmented Testing of Discrete Distributions
by: Aliakbarpour, Maryam, et al.
Published: (2024)

Robust High-Dimensional Mean Estimation With Low Data Size, an Empirical Study
by: Anderson, Cullen, et al.
Published: (2025)

Better Private Distribution Testing by Leveraging Unverified Auxiliary Data
by: Aliakbarpour, Maryam, et al.
Published: (2025)

How fast can you find a good hypothesis?
by: Aamand, Anders, et al.
Published: (2025)

Privacy in Metalearning and Multitask Learning: Modeling and Separations
by: Aliakbarpour, Maryam, et al.
Published: (2024)

Nearly-Linear Time Private Hypothesis Selection with the Optimal Approximation Factor
by: Aliakbarpour, Maryam, et al.
Published: (2025)

On the Structure of Replicable Hypothesis Testers
by: Aamand, Anders, et al.
Published: (2025)

Fixed Design Analysis of Regularization-Based Continual Learning
by: Li, Haoran, et al.
Published: (2023)

Enhancing Feature-Specific Data Protection via Bayesian Coordinate Differential Privacy
by: Aliakbarpour, Maryam, et al.
Published: (2024)

Dynamic Maintenance of Kernel Density Estimation Data Structure: From Practice to Theory
by: Liang, Jiehao, et al.
Published: (2022)

Metalearning with Very Few Samples Per Task
by: Aliakbarpour, Maryam, et al.
Published: (2023)

Fully Dynamic Adversarially Robust Correlation Clustering in Polylogarithmic Update Time
by: Braverman, Vladimir, et al.
Published: (2024)

Meta-Analysis with Untrusted Data
by: Kaul, Shiva, et al.
Published: (2024)

Memory-Statistics Tradeoff in Continual Learning with Structural Regularization
by: Li, Haoran, et al.
Published: (2025)

Solving Attention Kernel Regression Problem via Pre-conditioner
by: Song, Zhao, et al.
Published: (2023)

Binary Hypothesis Testing for Softmax Models and Leverage Score Models
by: Gu, Yuzhou, et al.
Published: (2024)

An Iterative Algorithm for Rescaled Hyperbolic Functions Regression
by: Gao, Yeqi, et al.
Published: (2023)

Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear Time
by: Gu, Yuzhou, et al.
Published: (2023)

Robust Clustering on High-Dimensional Data with Stochastic Quantization
by: Kozyriev, Anton, et al.
Published: (2024)

Robust Batched Bandits
by: Guo, Yunwen, et al.
Published: (2025)

FastDSAC: Unlocking the Potential of Maximum Entropy RL in High-Dimensional Humanoid Control
by: Xue, Jun, et al.
Published: (2026)

High-Dimensional Gaussian Mean Estimation under Realizable Contamination
by: Diakonikolas, Ilias, et al.
Published: (2026)

Shadow Tomography Against Adversaries
by: Aliakbarpour, Maryam, et al.
Published: (2025)

Adaptive and Stratified Subsampling for High-Dimensional Robust Estimation
by: Mittal, Prateek, et al.
Published: (2024)

Inverting the Leverage Score Gradient: An Efficient Approximate Newton Method
by: Li, Chenyang, et al.
Published: (2024)

Fast and Efficient Matching Algorithm with Deadline Instances
by: Song, Zhao, et al.
Published: (2023)

Robust Mean Estimation under Quantization
by: Abdalla, Pedro, et al.
Published: (2026)

Learning-augmented Maximum Independent Set
by: Braverman, Vladimir, et al.
Published: (2024)

Sample Complexity Bounds for Robust Mean Estimation with Mean-Shift Contamination
by: Diakonikolas, Ilias, et al.
Published: (2026)

Doubly-Robust Estimation of Counterfactual Policy Mean Embeddings
by: Zenati, Houssam, et al.
Published: (2025)

Efficient Alternating Minimization with Applications to Weighted Low Rank Approximation
by: Song, Zhao, et al.
Published: (2023)

Safe Exploitative Play with Untrusted Type Beliefs
by: Li, Tongxin, et al.
Published: (2024)

Robust Unsupervised Fault Diagnosis For High-Dimensional Nonlinear Noisy Data
by: Zhao, Dandan, et al.
Published: (2025)