| 501 |
SoS Certificates for Sparse Singular Values and Their Applications: Robust Statistics, Subspace Distortion, and More
Ilias Diakonikolas, Samuel B. Hopkins, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
4 |
1 year ago |
| 502 |
Constant Degree Networks for Almost-Everywhere Reliable Transmission
Mitali Bafna, Dor Minzer
|
👻
Ghosted
|
cs.DC
|
4 |
1 year ago |
| 503 |
Near-optimal Linear Sketches and Fully-Dynamic Algorithms for Hypergraph Spectral Sparsification
Sanjeev Khanna, Huan Li, Aaron Putterman
|
👻
Ghosted
|
cs.DS
|
4 |
1 year ago |
| 504 |
Unbounded lower bound for k-server against weak adversaries
Marcin Bienkowski, Jarosław Byrka, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
3 |
6 years ago |
| 505 |
Optimal transport between determinantal point processes and application to fast simulation
Laurent Decreusefond, Guillaume Moroz
|
👻
Ghosted
|
cs.DS
|
3 |
5 years ago |
| 506 |
Combinatorial Bernoulli Factories
Rad Niazadeh, Renato Paes Leme, Jon Schneider
|
👻
Ghosted
|
cs.DS
|
3 |
5 years ago |
| 507 |
Almost-Optimal Sublinear Additive Spanners
Zihan Tan, Tianyi Zhang
|
👻
Ghosted
|
cs.DS
|
3 |
3 years ago |
| 508 |
Work-Efficient Parallel Derandomization II: Optimal Concentrations via Bootstrapping
Mohsen Ghaffari, Christoph Grunau
|
👻
Ghosted
|
cs.DS
|
3 |
2 years ago |
| 509 |
Near-Optimal Mean Estimation with Unknown, Heteroskedastic Variances
Spencer Compton, Gregory Valiant
|
👻
Ghosted
|
math.ST
|
3 |
2 years ago |
| 510 |
A Concentration Bound for TD(0) with Function Approximation
Siddharth Chandak, Vivek S. Borkar
|
👻
Ghosted
|
cs.LG
|
3 |
2 years ago |
| 511 |
Hypergraph Unreliability in Quasi-Polynomial Time
Ruoxu Cen, Jason Li, Debmalya Panigrahi
|
👻
Ghosted
|
cs.DS
|
3 |
2 years ago |
| 512 |
Bypassing the Noisy Parity Barrier: Learning Higher-Order Markov Random Fields from Dynamics
Jason Gaitonde, Ankur Moitra, Elchanan Mossel
|
👻
Ghosted
|
cs.LG
|
3 |
1 year ago |
| 513 |
Near-Optimal Dimension Reduction for Facility Location
Lingxiao Huang, Shaofeng H. -C. Jiang, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
3 |
1 year ago |
| 514 |
Faster Weighted and Unweighted Tree Edit Distance and APSP Equivalence
Jakob Nogler, Adam Polak, ... (+4 more)
|
👻
Ghosted
|
cs.DS
|
3 |
1 year ago |
| 515 |
Stochastic Matching via In-n-Out Local Computation Algorithms
Amir Azarmehr, Soheil Behnezhad, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
3 |
1 year ago |
| 516 |
Correlation Clustering and (De)Sparsification: Graph Sketches Can Match Classical Algorithms
Sepehr Assadi, Sanjeev Khanna, Aaron Putterman
|
👻
Ghosted
|
cs.DS
|
3 |
1 year ago |
| 517 |
Process convergence for the complexity of Radix Selection on Markov sources
Kevin Leckey, Ralph Neininger, Henning Sulzbach
|
👻
Ghosted
|
math.PR
|
2 |
10 years ago |
| 518 |
Approximating Generalized Network Design under (Dis)economies of Scale with Applications to Energy Efficiency
Yuval Emek, Shay Kutten, ... (+2 more)
|
👻
Ghosted
|
cs.GT
|
2 |
8 years ago |
| 519 |
Computing better approximate pure Nash equilibria in cut games via semidefinite programming
Ioannis Caragiannis, Zhile Jiang
|
👻
Ghosted
|
cs.GT
|
2 |
3 years ago |
| 520 |
On Stein's lemma in hypotheses testing in general non-asymptotic case
Marat V. Burnashev
|
👻
Ghosted
|
cs.IT
|
2 |
3 years ago |
| 521 |
Interior Point Methods with a Gradient Oracle
Adrian Vladu
|
👻
Ghosted
|
cs.DS
|
2 |
3 years ago |
| 522 |
Near-Optimal Streaming Ellipsoidal Rounding for General Convex Polytopes
Yury Makarychev, Naren Sarayu Manoj, Max Ovsiankin
|
👻
Ghosted
|
cs.DS
|
2 |
2 years ago |
| 523 |
Evolving privacy: drift parameter estimation for discretely observed i.i.d. diffusion processes under LDP
Chiara Amorino, Arnaud Gloter, Hélène Halconruy
|
👻
Ghosted
|
math.ST
|
2 |
2 years ago |
| 524 |
Approximating Small Sparse Cuts
Aditya Anand, Euiwoong Lee, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
2 |
2 years ago |
| 525 |
Private graphon estimation via sum-of-squares
Hongjie Chen, Jingqiu Ding, ... (+4 more)
|
👻
Ghosted
|
cs.DS
|
2 |
2 years ago |
| 526 |
Super Non-singular Decompositions of Polynomials and their Application to Robustly Learning Low-degree PTFs
Ilias Diakonikolas, Daniel M. Kane, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
2 |
2 years ago |
| 527 |
On approximability of the Permanent of PSD matrices
Farzam Ebrahimnejad, Ansh Nagda, Shayan Oveis Gharan
|
👻
Ghosted
|
cs.DS
|
2 |
2 years ago |
| 528 |
Distribution-Free Testing of Decision Lists with a Sublinear Number of Queries
Xi Chen, Yumou Fei, Shyamal Patel
|
👻
Ghosted
|
cs.DS
|
2 |
2 years ago |
| 529 |
Almost Linear Size Edit Distance Sketch
Michal Koucký, Michael Saks
|
👻
Ghosted
|
cs.DS
|
2 |
2 years ago |
| 530 |
Testing Support Size More Efficiently Than Learning Histograms
Renato Ferreira Pinto, Nathaniel Harms
|
👻
Ghosted
|
cs.DS
|
2 |
1 year ago |
| 531 |
Oblivious Defense in ML Models: Backdoor Removal without Detection
Shafi Goldwasser, Jonathan Shafer, ... (+2 more)
|
👻
Ghosted
|
cs.LG
|
2 |
1 year ago |
| 532 |
Learning the Sherrington-Kirkpatrick Model Even at Low Temperature
Gautam Chandrasekaran, Adam Klivans
|
👻
Ghosted
|
cs.LG
|
2 |
1 year ago |
| 533 |
Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth
Zhuan Khye Koh, Omri Weinstein, Sorrachai Yingchareonthawornchai
|
👻
Ghosted
|
cs.DS
|
2 |
1 year ago |
| 534 |
The Cost of Consistency: Submodular Maximization with Constant Recourse
Paul Dütting, Federico Fusco, ... (+4 more)
|
👻
Ghosted
|
cs.DS
|
2 |
1 year ago |
| 535 |
Optimal Static Dictionary with Worst-Case Constant Query Time
Yang Hu, Jingxun Liang, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
2 |
1 year ago |
| 536 |
Fingerprinting Codes Meet Geometry: Improved Lower Bounds for Private Query Release and Adaptive Data Analysis
Xin Lyu, Kunal Talwar
|
👻
Ghosted
|
cs.DS
|
2 |
1 year ago |
| 537 |
On the Locality of the Lovász Local Lemma
Peter Davies-Peck
|
👻
Ghosted
|
cs.DS
|
2 |
1 year ago |
| 538 |
Monotonicity Testing of High-Dimensional Distributions with Subcube Conditioning
Deeparnab Chakrabarty, Xi Chen, ... (+3 more)
|
👻
Ghosted
|
math.ST
|
2 |
1 year ago |
| 539 |
Privately Evaluating Untrusted Black-Box Functions
Ephraim Linder, Sofya Raskhodnikova, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
2 |
1 year ago |
| 540 |
Covering Approximate Shortest Paths with DAGs
Sepehr Assadi, Gary Hoppenworth, Nicole Wein
|
👻
Ghosted
|
cs.DS
|
2 |
1 year ago |
| 541 |
Simple and Optimal Algorithms for Heavy Hitters and Frequency Moments in Distributed Models
Zengfeng Huang, Zhongzheng Xiong, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
2 |
1 year ago |
| 542 |
DNF Learning via Locally Mixing Random Walks
Josh Alman, Shivam Nadimpalli, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
2 |
1 year ago |
| 543 |
Approximating binary longest common subsequence in almost-linear time
Xiaoyu He, Ray Li
|
👻
Ghosted
|
cs.DS
|
1 |
3 years ago |
| 544 |
Polylog-Competitive Deterministic Local Routing and Scheduling
Bernhard Haeupler, Shyamal Patel, ... (+3 more)
|
👻
Ghosted
|
cs.DC
|
1 |
2 years ago |
| 545 |
Explicit Orthogonal Arrays and Universal Hashing with Arbitrary Parameters
Nicholas Harvey, Arvin Sahami
|
👻
Ghosted
|
cs.DS
|
1 |
2 years ago |
| 546 |
Dynamic Locality Sensitive Orderings in Doubling Metrics
An La, Hung Le
|
👻
Ghosted
|
cs.DS
|
1 |
1 year ago |
| 547 |
Subexponential Parameterized Algorithms for Hitting Subgraphs
Daniel Lokshtanov, Fahad Panolan, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
1 |
1 year ago |
| 548 |
List-Decoding Capacity Implies Capacity on the q-ary Symmetric Channel
Francisco Pernice, Oscar Sprumont, Mary Wootters
|
👻
Ghosted
|
cs.IT
|
1 |
1 year ago |
| 549 |
Fast, robust approximate message passing
Misha Ivkov, Tselil Schramm
|
👻
Ghosted
|
cs.DS
|
1 |
1 year ago |
| 550 |
On Reductions and Representations of Learning Problems in Euclidean Spaces
Bogdan Chornomaz, Shay Moran, Tom Waknine
|
👻
Ghosted
|
cs.LG
|
1 |
1 year ago |