Cover Image

Random Subgraph Detection Using Queries

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Huleihel, Wasim, Mazumdar, Arya, Pal, Soumyabrata
Format:	Preprint
Published:	2021
Subjects:	Data Structures and Algorithms Information Theory Machine Learning Statistics Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

Robust Detection of Planted Subgraphs in Semi-Random Models
by: Elimelech, Dor, et al.
Published: (2025)

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

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

Detecting Arbitrary Planted Subgraphs in Random Graphs
by: Elimelech, Dor, et al.
Published: (2025)

Binary Iterative Hard Thresholding Converges with Optimal Number of Measurements for 1-Bit Compressed Sensing
by: Matsumoto, Namiko, et al.
Published: (2022)

Detection of Correlated Random Vectors
by: Elimelech, Dor, et al.
Published: (2024)

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)

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

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

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

Probability Tools for Sequential Random Projection
by: Li, Yingru
Published: (2024)

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

Sparse Linear Regression is Easy on Random Supports
by: Chandrasekaran, Gautam, et al.
Published: (2025)

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

Noisy Nonadaptive Group Testing with Binary Splitting: New Test Design and Improvement on Price-Scarlett-Tan's Scheme
by: Li, Xiaxin, et al.
Published: (2024)

Support Recovery in One-bit Compressed Sensing with Near-Optimal Measurements and Sublinear Time
by: Li, Xiaxin, et al.
Published: (2025)

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

Graph Reconstruction from Noisy Random Subgraphs
by: McGregor, Andrew, et al.
Published: (2024)

Non-adaptive Learning of Random Hypergraphs with Queries
by: Austhof, Bethany, et al.
Published: (2025)

The Broader Landscape of Robustness in Algorithmic Statistics
by: Kamath, Gautam
Published: (2024)

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

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

Guaranteed Recovery of Unambiguous Clusters
by: Mazooji, Kayvon, et al.
Published: (2025)

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

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

Query Lower Bounds for Diffusion Sampling
by: Xun, Zhiyang, et al.
Published: (2026)

The Empirical Spectral Distribution of i.i.d. Random Matrices with Random Perturbations
by: Chen, Kun, et al.
Published: (2024)

Low-degree Security of the Planted Random Subgraph Problem
by: Bogdanov, Andrej, et al.
Published: (2024)

Asymptotically Optimal Sequential Testing with Heterogeneous LLMs
by: Li, Guokai, et al.
Published: (2026)

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

Learning Mixtures of Gaussians Using Diffusion Models
by: Gatmiry, Khashayar, et al.
Published: (2024)

Rényi-infinity constrained sampling with $d^3$ membership queries
by: Kook, Yunbum, et al.
Published: (2024)

Is Transductive Learning Equivalent to PAC Learning?
by: Dughmi, Shaddin, et al.
Published: (2024)

Almost-Optimal Local-Search Methods for Sparse Tensor PCA
by: Lovig, Max, et al.
Published: (2025)

A Note on Non-Negative $L_1$-Approximating Polynomials
by: Lee, Jane H., et al.
Published: (2026)

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

Batch List-Decodable Linear Regression via Higher Moments
by: Diakonikolas, Ilias, et al.
Published: (2025)