Copertina

Tractable Gaussian Phase Retrieval with Heavy Tails and Adversarial Corruption with Near-Linear Sample Complexity

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Das, Santanu, Batra, Jatin
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Convex Basins in Single-Index Model Loss Landscapes: Applications to Robust Recovery under Strong Adversarial Corruption
di: Das, Santanu, et al.
Pubblicazione: (2026)

A direct proof of a unified law of robustness for Bregman divergence losses
di: Das, Santanu, et al.
Pubblicazione: (2024)

Robust and Computationally Efficient Linear Contextual Bandits under Adversarial Corruption and Heavy-Tailed Noise
di: Tani, Naoto, et al.
Pubblicazione: (2026)

Near-Optimal Streaming Heavy-Tailed Statistical Estimation with Clipped SGD
di: Das, Aniket, et al.
Pubblicazione: (2024)

Disagreement-Regularized Importance Sampling for Adversarial Label Corruption
di: Horváth, Csongor, et al.
Pubblicazione: (2026)

A Separation in Heavy-Tailed Sampling: Gaussian vs. Stable Oracles for Proximal Samplers
di: He, Ye, et al.
Pubblicazione: (2024)

Second-order Optimization under Heavy-Tailed Noise: Hessian Clipping and Sample Complexity Limits
di: Sadiev, Abdurakhmon, et al.
Pubblicazione: (2025)

Heavy-Tailed Linear Bandits: Huber Regression with One-Pass Update
di: Wang, Jing, et al.
Pubblicazione: (2025)

Tail Annealing for Heavy-Tailed Flow Matching
di: Pachebat, Jean
Pubblicazione: (2026)

Near-Optimal Decentralized Stochastic Nonconvex Optimization with Heavy-Tailed Noise
di: Wang, Menglian, et al.
Pubblicazione: (2026)

Improved Regret Bounds for Linear Bandits with Heavy-Tailed Rewards
di: Tajdini, Artin, et al.
Pubblicazione: (2025)

Data-Driven Upper Confidence Bounds with Near-Optimal Regret for Heavy-Tailed Bandits
di: Tamás, Ambrus, et al.
Pubblicazione: (2024)

A Near-optimal, Scalable and Parallelizable Framework for Stochastic Bandits Robust to Adversarial Corruptions and Beyond
di: Hu, Zicheng, et al.
Pubblicazione: (2025)

A Jointly Efficient and Optimal Algorithm for Heteroskedastic Generalized Linear Bandits with Adversarial Corruptions
di: Kim, Sanghwa, et al.
Pubblicazione: (2026)

Comparing skill of historical rainfall data based monsoon rainfall prediction in India with NWP forecasts
di: Narula, Apoorva, et al.
Pubblicazione: (2024)

Phase-Type Variational Autoencoders for Heavy-Tailed Data
di: Ziani, Abdelhakim, et al.
Pubblicazione: (2026)

Asynchronous Heavy-Tailed Optimization
di: Sun, Junfei, et al.
Pubblicazione: (2026)

Heavy-Tailed Diffusion Models
di: Pandey, Kushagra, et al.
Pubblicazione: (2024)

Robust Time Series Forecasting with Non-Heavy-Tailed Gaussian Loss-Weighted Sampler
di: You, Jiang, et al.
Pubblicazione: (2024)

Cascading Bandits Robust to Adversarial Corruptions
di: Xie, Jize, et al.
Pubblicazione: (2025)

Wedge Sampling: Efficient Tensor Completion with Nearly-Linear Sample Complexity
di: Luo, Hengrui, et al.
Pubblicazione: (2026)

Robust Linear Dueling Bandits with Post-serving Context under Unknown Delays and Adversarial Corruptions
di: Oh, Youngmin
Pubblicazione: (2026)

A Rigorous, Tractable Measure of Model Complexity
di: Allerbo, Oskar, et al.
Pubblicazione: (2026)

Heavy-Tailed Principal Component Analysis
di: Sayde, Mario, et al.
Pubblicazione: (2026)

Models of Heavy-Tailed Mechanistic Universality
di: Hodgkinson, Liam, et al.
Pubblicazione: (2025)

Diffusion Models with Heavy-Tailed Targets: Score Estimation and Sampling Guarantees
di: Yu, Yifeng, et al.
Pubblicazione: (2026)

Learning with Monotone Adversarial Corruptions
di: Larsen, Kasper Green, et al.
Pubblicazione: (2026)

Tractable Multinomial Logit Contextual Bandits with Non-Linear Utilities
di: Hwang, Taehyun, et al.
Pubblicazione: (2026)

Tractable MCMC for Private Learning with Pure and Gaussian Differential Privacy
di: Lin, Yingyu, et al.
Pubblicazione: (2023)

Sparse Linear Regression when Noises and Covariates are Heavy-Tailed and Contaminated by Outliers
di: Sasai, Takeyuki, et al.
Pubblicazione: (2024)

Near-Optimal Dynamic Regret for Adversarial Linear Mixture MDPs
di: Li, Long-Fei, et al.
Pubblicazione: (2024)

Stochastic Bilevel Optimization with Heavy-Tailed Noise
di: Liu, Zhuanghua, et al.
Pubblicazione: (2025)

Stress-Testing ML Pipelines with Adversarial Data Corruption
di: Zhu, Jiongli, et al.
Pubblicazione: (2025)

Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions
di: Ghaffari, Fatemeh, et al.
Pubblicazione: (2024)

Robust Distribution Learning with Local and Global Adversarial Corruptions
di: Nietert, Sloan, et al.
Pubblicazione: (2024)

Heavy-tailed Linear Bandits: Adversarial Robustness, Best-of-both-worlds, and Beyond
di: Zhao, Canzhe, et al.
Pubblicazione: (2025)

Approximating Heavy-Tailed Distributions with a Mixture of Bernstein Phase-Type and Hyperexponential Models
di: Ziani, Abdelhakim, et al.
Pubblicazione: (2025)

High Probability Complexity Bounds for Non-Smooth Stochastic Optimization with Heavy-Tailed Noise
di: Gorbunov, Eduard, et al.
Pubblicazione: (2021)

Heavy-Tail Phenomenon in Decentralized SGD
di: Gurbuzbalaban, Mert, et al.
Pubblicazione: (2022)

Private Stochastic Convex Optimization with Heavy Tails: Near-Optimality from Simple Reductions
di: Asi, Hilal, et al.
Pubblicazione: (2024)