Image de couverture de livre

Smoothed Score Queries and the Complexity of Sampling

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Liu, Jingbo
Format:	Preprint
Publié:	2026
Sujets:	Data Structures and Algorithms Information Theory Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Learning Partitions with Optimal Query and Round Complexities
par: Black, Hadley, et autres
Publié: (2025)

On the Statistical Complexity of Sample Amplification
par: Axelrod, Brian, et autres
Publié: (2022)

Testing with Non-identically Distributed Samples
par: Garg, Shivam, et autres
Publié: (2023)

Random Subgraph Detection Using Queries
par: Huleihel, Wasim, et autres
Publié: (2021)

Sample-Optimal Private Regression in Polynomial Time
par: Anderson, Prashanti, et autres
Publié: (2025)

Non-adaptive Learning of Random Hypergraphs with Queries
par: Austhof, Bethany, et autres
Publié: (2025)

Smoothed Analysis of Learning from Positive Samples
par: Lee, Jane H., et autres
Publié: (2025)

Optimal Differentially Private Sampling of Unbounded Gaussians
par: Iverson, Valentio, et autres
Publié: (2025)

Learning DNF through Generalized Fourier Representations
par: Heidari, Mohsen, et autres
Publié: (2025)

The SMART approach to instance-optimal online learning
par: Banerjee, Siddhartha, et autres
Publié: (2024)

Subsampling Suffices for Adaptive Data Analysis
par: Blanc, Guy
Publié: (2023)

A Framework for Searching in Graphs in the Presence of Errors
par: Dereniowski, Dariusz, et autres
Publié: (2018)

Learning multivariate Gaussians with imperfect advice
par: Bhattacharyya, Arnab, et autres
Publié: (2024)

Entropy Coding of Unordered Data Structures
par: Kunze, Julius, et autres
Publié: (2024)

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs
par: Black, Hadley, et autres
Publié: (2025)

The Geometry of LLM Quantization: GPTQ as Babai's Nearest Plane Algorithm
par: Chen, Jiale, et autres
Publié: (2025)

Statistical Query Lower Bounds for Smoothed Agnostic Learning
par: Diakonikolas, Ilias, et autres
Publié: (2026)

Mixtures of Gaussians are Privately Learnable with a Polynomial Number of Samples
par: Afzali, Mohammad, et autres
Publié: (2023)

Reveal-or-Obscure: A Differentially Private Sampling Algorithm for Discrete Distributions
par: Tasnim, Naima, et autres
Publié: (2025)

Sample Complexity Bounds for Robust Mean Estimation with Mean-Shift Contamination
par: Diakonikolas, Ilias, et autres
Publié: (2026)

The I/O Complexity of Attention, or How Optimal is Flash Attention?
par: Saha, Barna, et autres
Publié: (2024)

Complexity of Non-Log-Concave Sampling in Fisher Information
par: Chewi, Sinho, et autres
Publié: (2026)

PTF Testing Lower Bounds for Non-Gaussian Component Analysis
par: Diakonikolas, Ilias, et autres
Publié: (2025)

Smooth Nash Equilibria: Algorithms and Complexity
par: Daskalakis, Constantinos, et autres
Publié: (2023)

Query Lower Bounds for Diffusion Sampling
par: Xun, Zhiyang, et autres
Publié: (2026)

PAC Learning with Bandit Feedback: Sharp Sample Complexity in the Realizable Setting
par: Hanneke, Steve, et autres
Publié: (2026)

The Information Theory of Similarity
par: Phadke, Nikit
Publié: (2025)

The Sample Complexity of Smooth Boosting and the Tightness of the Hardcore Theorem
par: Blanc, Guy, et autres
Publié: (2024)

Orthogonal Nonnegative Matrix Factorization with Sparsity Constraints
par: Basiri, Salar, et autres
Publié: (2022)

Distribution Learnability and Robustness
par: Ben-David, Shai, et autres
Publié: (2024)

A Distribution Testing Approach to Clustering Distributions
par: Kumar, Gunjan, et autres
Publié: (2025)

Learning sparse generalized linear models with binary outcomes via iterative hard thresholding
par: Matsumoto, Namiko, et autres
Publié: (2025)

Planted Bipartite Graph Detection
par: Rotenberg, Asaf, et autres
Publié: (2023)

Finite Sample Bounds for Learning with Score Matching
par: Smedira, Devin, et autres
Publié: (2026)

On the Complexity of Learning Sparse Functions with Statistical and Gradient Queries
par: Joshi, Nirmit, et autres
Publié: (2024)

Improved classical shadows from local symmetries in the Schur basis
par: Grier, Daniel, et autres
Publié: (2024)

An optimal tradeoff between entanglement and copy complexity for state tomography
par: Chen, Sitan, et autres
Publié: (2024)

Optimal high-precision shadow estimation
par: Chen, Sitan, et autres
Publié: (2024)

DDPM Score Matching and Distribution Learning
par: Chewi, Sinho, et autres
Publié: (2025)

Statistical Query Lower Bounds for Learning Truncated Gaussians
par: Diakonikolas, Ilias, et autres
Publié: (2024)