Imagen de Portada

Planted Bipartite Graph Detection

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Rotenberg, Asaf, Huleihel, Wasim, Shayevitz, Ofer
Formato:	Preprint
Publicado:	2023
Materias:	Data Structures and Algorithms Information Theory Machine Learning Statistics Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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)

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

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

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

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

Detection of Correlated Random Vectors
por: Elimelech, Dor, et al.
Publicado: (2024)

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

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

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 Graph Matching for Correlated Stochastic Block Models
por: Chai, Shuwen, et al.
Publicado: (2024)

Achievability of Heterogeneous Hypergraph Recovery from its Graph Projection
por: Morgan, Alexander, et al.
Publicado: (2026)

Probability Tools for Sequential Random Projection
por: Li, Yingru
Publicado: (2024)

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

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

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

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

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

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

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

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

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

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

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

Fast Tensor Completion via Approximate Richardson Iteration
por: Ghadiri, Mehrdad, et al.
Publicado: (2025)

Linear Regression with Unknown Truncation Beyond Gaussian Features
por: Kouridakis, Alexandros, et al.
Publicado: (2026)

Information-Computation Tradeoffs for Noiseless Linear Regression with Oblivious Contamination
por: Diakonikolas, Ilias, et al.
Publicado: (2025)

Easy, robust approximate message passing for planted spike models
por: Ivkov, Misha, et al.
Publicado: (2026)

A Sub-Quadratic Time Algorithm for Robust Sparse Mean Estimation
por: Pensia, Ankit
Publicado: (2024)

One-Shot Learning for k-SAT
por: Galanis, Andreas, et al.
Publicado: (2025)

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

Covariance estimation using Markov chain Monte Carlo
por: Kook, Yunbum, et al.
Publicado: (2024)

SoS Certifiability of Subgaussian Distributions and its Algorithmic Applications
por: Diakonikolas, Ilias, et al.
Publicado: (2024)

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