Imagen de Portada

On the Statistical Complexity of Sample Amplification

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Axelrod, Brian, Garg, Shivam, Han, Yanjun, Sharan, Vatsal, Valiant, Gregory
Formato:	Preprint
Publicado:	2022
Materias:	Statistics Theory Data Structures and Algorithms Information Theory Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Sample Amplification: Increasing Dataset Size even when Learning is Impossible
por: Axelrod, Brian, et al.
Publicado: (2019)

Testing with Non-identically Distributed Samples
por: Garg, Shivam, et al.
Publicado: (2023)

Attainability of Two-Point Testing Rates for Finite-Sample Location Estimation
por: Compton, Spencer, et al.
Publicado: (2025)

Discovering Data Structures: Nearest Neighbor Search and Beyond
por: Salemohamed, Omar, et al.
Publicado: (2024)

A Generalized Trace Reconstruction Problem: Recovering a String of Probabilities
por: Rivkin, Joey, et al.
Publicado: (2024)

Faster Diffusion Sampling with Randomized Midpoints: Sequential and Parallel
por: Gupta, Shivam, et al.
Publicado: (2024)

A Simple Geometric Proof of the Optimality of the Sequential Probability Ratio Test for Symmetric Bernoulli Hypotheses
por: Pabbaraju, Chirag, et al.
Publicado: (2025)

The Broader Landscape of Robustness in Algorithmic Statistics
por: Kamath, Gautam
Publicado: (2024)

Complexity of Non-Log-Concave Sampling in Fisher Information
por: Chewi, Sinho, et al.
Publicado: (2026)

Beyond Catoni: Sharper Rates for Heavy-Tailed and Robust Mean Estimation
por: Gupta, Shivam, et al.
Publicado: (2023)

Better and Simpler Lower Bounds for Differentially Private Statistical Estimation
por: Narayanan, Shyam
Publicado: (2023)

Distribution Learnability and Robustness
por: Ben-David, Shai, et al.
Publicado: (2024)

A Distribution Testing Approach to Clustering Distributions
por: Kumar, Gunjan, et al.
Publicado: (2025)

Random Subgraph Detection Using Queries
por: Huleihel, Wasim, et al.
Publicado: (2021)

Learning sparse generalized linear models with binary outcomes via iterative hard thresholding
por: Matsumoto, Namiko, et al.
Publicado: (2025)

Planted Bipartite Graph Detection
por: Rotenberg, Asaf, et al.
Publicado: (2023)

PTF Testing Lower Bounds for Non-Gaussian Component Analysis
por: Diakonikolas, Ilias, et al.
Publicado: (2025)

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

PAC Learning with Bandit Feedback: Sharp Sample Complexity in the Realizable Setting
por: Hanneke, Steve, et al.
Publicado: (2026)

Posterior Sampling by Combining Diffusion Models with Annealed Langevin Dynamics
por: Xun, Zhiyang, et al.
Publicado: (2025)

Smoothed Score Queries and the Complexity of Sampling
por: Liu, Jingbo
Publicado: (2026)

Complexity of High-Dimensional Identity Testing with Coordinate Conditional Sampling
por: Blanca, Antonio, et al.
Publicado: (2022)

On Unbiased Low-Rank Approximation with Minimum Distortion
por: Barnes, Leighton Pate, et al.
Publicado: (2025)

Statistical Query Lower Bounds for Learning Truncated Gaussians
por: Diakonikolas, Ilias, et al.
Publicado: (2024)

High-dimensional estimation with missing data: Statistical and computational limits
por: Verchand, Kabir Aladin, et al.
Publicado: (2026)

The Geometry of Efficient Nonconvex Sampling
por: Vempala, Santosh S., et al.
Publicado: (2026)

In-and-Out: Algorithmic Diffusion for Sampling Convex Bodies
por: Kook, Yunbum, et al.
Publicado: (2024)

Sampling and Integration of Logconcave Functions by Algorithmic Diffusion
por: Kook, Yunbum, et al.
Publicado: (2024)

Smoothed Analysis of Learning from Positive Samples
por: Lee, Jane H., et al.
Publicado: (2025)

Sample-Efficient Private Learning of Mixtures of Gaussians
por: Ashtiani, Hassan, et al.
Publicado: (2024)

Sampling and Identity-Testing Without Approximate Tensorization of Entropy
por: Gay, William, et al.
Publicado: (2025)

Sample-Efficient Linear Regression with Self-Selection Bias
por: Gaitonde, Jason, et al.
Publicado: (2024)

Simple and Nearly-Optimal Sampling for Rank-1 Tensor Completion via Gauss-Jordan
por: Gomez-Leos, Alejandro, et al.
Publicado: (2024)

Efficient Convex Optimization Requires Superlinear Memory
por: Marsden, Annie, et al.
Publicado: (2022)

Simultaneous Swap Regret Minimization via KL-Calibration
por: Luo, Haipeng, et al.
Publicado: (2025)

Entropy Equivalence Testing
por: Canonne, Clément L., et al.
Publicado: (2026)

Guaranteed Recovery of Unambiguous Clusters
por: Mazooji, Kayvon, et al.
Publicado: (2025)

Optimal Rates for Differentially Private Hypothesis Testing with E-values
por: Jacobsen, Ben, et al.
Publicado: (2026)

CoinPress: Practical Private Mean and Covariance Estimation
por: Biswas, Sourav, et al.
Publicado: (2020)

Efficient Statistics With Unknown Truncation, Polynomial Time Algorithms, Beyond Gaussians
por: Lee, Jane H., et al.
Publicado: (2024)