Cover Image

Subsampling Suffices for Adaptive Data Analysis

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Blanc, Guy
Format:	Preprint
Published:	2023
Subjects:	Machine Learning Data Structures and Algorithms Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Robust Learning with Optimal Error
by: Blanc, Guy
Published: (2026)

Entropy Coding of Unordered Data Structures
by: Kunze, Julius, et al.
Published: (2024)

Adaptive and oblivious statistical adversaries are equivalent
by: Blanc, Guy, et al.
Published: (2024)

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

Differential privacy from axioms
by: Blanc, Guy, et al.
Published: (2025)

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

Learning DNF through Generalized Fourier Representations
by: Heidari, Mohsen, et al.
Published: (2025)

The SMART approach to instance-optimal online learning
by: Banerjee, Siddhartha, et al.
Published: (2024)

Learning Partitions with Optimal Query and Round Complexities
by: Black, Hadley, et al.
Published: (2025)

A Framework for Searching in Graphs in the Presence of Errors
by: Dereniowski, Dariusz, et al.
Published: (2018)

Smoothed Score Queries and the Complexity of Sampling
by: Liu, Jingbo
Published: (2026)

Learning multivariate Gaussians with imperfect advice
by: Bhattacharyya, Arnab, et al.
Published: (2024)

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs
by: Black, Hadley, et al.
Published: (2025)

Sample-Optimal Private Regression in Polynomial Time
by: Anderson, Prashanti, et al.
Published: (2025)

The Geometry of LLM Quantization: GPTQ as Babai's Nearest Plane Algorithm
by: Chen, Jiale, et al.
Published: (2025)

Instance-Optimal Uniformity Testing and Tracking
by: Blanc, Guy, et al.
Published: (2025)

Analysis of Shuffling Beyond Pure Local Differential Privacy
by: Takagi, Shun, et al.
Published: (2026)

The Information Theory of Similarity
by: Phadke, Nikit
Published: (2025)

Orthogonal Nonnegative Matrix Factorization with Sparsity Constraints
by: Basiri, Salar, et al.
Published: (2022)

Optimal and Near-Optimal Adaptive Vector Quantization
by: Ben-Basat, Ran, et al.
Published: (2024)

Planted Bipartite Graph Detection
by: Rotenberg, Asaf, et al.
Published: (2023)

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

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

Random Subgraph Detection Using Queries
by: Huleihel, Wasim, et al.
Published: (2021)

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

On the Statistical Complexity of Sample Amplification
by: Axelrod, Brian, et al.
Published: (2022)

Efficient Adaptive Data Analysis over Dense Distributions
by: Huh, Joon Suk
Published: (2026)

Convergence Analysis for Deep Sparse Coding via Convolutional Neural Networks
by: Li, Jianfei, et al.
Published: (2024)

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

Lower Bounds on Adaptive Sensing for Matrix Recovery
by: Kacham, Praneeth, et al.
Published: (2023)

Mean estimation in the add-remove model of differential privacy
by: Kulesza, Alex, et al.
Published: (2023)

Mixtures of Gaussians are Privately Learnable with a Polynomial Number of Samples
by: Afzali, Mohammad, et al.
Published: (2023)

SpecTr: Fast Speculative Decoding via Optimal Transport
by: Sun, Ziteng, et al.
Published: (2023)

Fast Computation of Optimal Transport via Entropy-Regularized Extragradient Methods
by: Li, Gen, et al.
Published: (2023)

Gap-Free Clustering: Sensitivity and Robustness of SDP
by: Zurek, Matthew, et al.
Published: (2023)

Best Agent Identification for General Game Playing
by: Stephenson, Matthew, et al.
Published: (2025)

The I/O Complexity of Attention, or How Optimal is Flash Attention?
by: Saha, Barna, et al.
Published: (2024)

Private Vector Mean Estimation in the Shuffle Model: Optimal Rates Require Many Messages
by: Asi, Hilal, et al.
Published: (2024)

Improved classical shadows from local symmetries in the Schur basis
by: Grier, Daniel, et al.
Published: (2024)

Block Verification Accelerates Speculative Decoding
by: Sun, Ziteng, et al.
Published: (2024)