Raghu Meka

Orcid: 0009-0004-7676-2762

According to our database1, Raghu Meka authored at least 90 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Lasso with Latents: Efficient Estimation, Covariate Rescaling, and Computational-Statistical Gaps.
Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

On Convex Optimization with Semi-Sensitive Features.
Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

Smoothed Analysis for Learning Concepts with Low Intrinsic Dimension.
Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

Learning Neural Networks with Sparse Activations.
Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

2023
Special Issue: APPROX-RANDOM 2020: Guest Editor's Foreword.
Theory Comput., 2023

Explicit separations between randomized and deterministic Number-on-Forehead communication.
Electron. Colloquium Comput. Complex., 2023

New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms.
Electron. Colloquium Comput. Complex., 2023

Simple Mechanisms for Representing, Indexing and Manipulating Concepts.
CoRR, 2023

Resolving Matrix Spencer Conjecture Up to Poly-logarithmic Rank.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Feature Adaptation for Sparse Linear Regression.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

User-Level Differential Privacy With Few Examples Per User.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

On User-Level Private Convex Optimization.
Proceedings of the International Conference on Machine Learning, 2023

Strong Bounds for 3-Progressions.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

On the Benefits of Learning to Route in Mixture-of-Experts Models.
Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing, 2023

Learning Narrow One-Hidden-Layer ReLU Networks.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022
Approximating Rectangles by Juntas and Weakly Exponential Lower Bounds for LP Relaxations of CSPs.
SIAM J. Comput., 2022

Efficient resilient functions.
Electron. Colloquium Comput. Complex., 2022

Distributional Hardness Against Preconditioned Lasso via Erasure-Robust Designs.
CoRR, 2022

Lower Bounds on Randomly Preconditioned Lasso via Robust Sparse Designs.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Sketching based Representations for Robust Image Classification with Provable Guarantees.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Hardness of Noise-Free Learning for Two-Hidden-Layer Neural Networks.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Lifting with Sunflowers.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Prefix Discrepancy, Smoothed Analysis, and Combinatorial Vector Balancing.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Minimax Optimality (Probably) Doesn't Imply Distribution Learning for GANs.
Proceedings of the Tenth International Conference on Learning Representations, 2022

Smoothed Analysis of the Komlós Conjecture.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021
Random restrictions and PRGs for PTFs in Gaussian Space.
Electron. Colloquium Comput. Complex., 2021

Monotone Branching Programs: Pseudorandomness and Circuit Complexity.
Electron. Colloquium Comput. Complex., 2021

Efficiently Learning Any One Hidden Layer ReLU Network From Queries.
CoRR, 2021

Online Discrepancy Minimization for Stochastic Arrivals.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Efficiently Learning One Hidden Layer ReLU Networks From Queries.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

On the Power of Preconditioning in Sparse Linear Regression.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

Learning Deep ReLU Networks Is Fixed-Parameter Tractable.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

Pseudorandom Generators for Read-Once Monotone Branching Programs.
Proceedings of the Approximation, 2021

2020
On the discrepancy of random low degree set systems.
Random Struct. Algorithms, 2020

Improved lifting theorems via robust sunflowers.
Electron. Colloquium Comput. Complex., 2020

Bounded Collusion Protocols, Cylinder-Intersection Extractors and Leakage-Resilient Secret Sharing.
Electron. Colloquium Comput. Complex., 2020

Learning Some Popular Gaussian Graphical Models without Condition Number Bounds.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Extractors and Secret Sharing Against Bounded Collusion Protocols.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

Balancing Gaussian vectors in high dimension.
Proceedings of the Conference on Learning Theory, 2020

Learning Polynomials in Few Relevant Dimensions.
Proceedings of the Conference on Learning Theory, 2020

2019
Average Bias and Polynomial Sources.
Electron. Colloquium Comput. Complex., 2019

Leakage-Resilient Secret Sharing Against Colluding Parties.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2018
Pseudorandomness via the Discrete Fourier Transform.
SIAM J. Comput., 2018

Pseudorandom Generators for Width-3 Branching Programs.
Electron. Colloquium Comput. Complex., 2018

Leakage-Resilient Secret Sharing.
Electron. Colloquium Comput. Complex., 2018

Learning One Convolutional Layer with Overlapping Patches.
Proceedings of the 35th International Conference on Machine Learning, 2018

Efficient Algorithms for Outlier-Robust Regression.
Proceedings of the Conference On Learning Theory, 2018

2017
Learning Graphical Models Using Multiplicative Weights.
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2016
Anti-concentration for Polynomials of Independent Random Variables.
Theory Comput., 2016

Special Section on the Fifty-Fourth Annual IEEE Symposium on Foundations of Computer Science (FOCS 2013).
SIAM J. Comput., 2016

Rectangles Are Nonnegative Juntas.
SIAM J. Comput., 2016

2015
Constructive Discrepancy Minimization by Walking on the Edges.
SIAM J. Comput., 2015

Making the Long Code Shorter.
SIAM J. Comput., 2015

Explicit resilient functions matching Ajtai-Linial.
Electron. Colloquium Comput. Complex., 2015

Sum-of-squares Lower Bounds for Planted Clique.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Almost Optimal Pseudorandom Generators for Spherical Caps: Extended Abstract.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

2014
Bounding the Sensitivity of Polynomial Threshold Functions.
Theory Comput., 2014

Communication with Imperfectly Shared Randomness.
Electron. Colloquium Comput. Complex., 2014

Almost Optimal Pseudorandom Generators for Spherical Caps.
CoRR, 2014

Pseudorandomness for concentration bounds and signed majorities.
CoRR, 2014

Fast Pseudorandomness for Independence and Load Balancing - (Extended Abstract).
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Volumetric Spanners: an Efficient Exploration Basis for Learning.
Proceedings of The 27th Conference on Learning Theory, 2014

Computational Limits for Matrix Completion.
Proceedings of The 27th Conference on Learning Theory, 2014

Deterministic Coupon Collection and Better Strong Dispersers.
Proceedings of the Approximation, 2014

2013
Pseudorandom Generators for Polynomial Threshold Functions.
SIAM J. Comput., 2013

Pseudorandom Generators for Combinatorial Shapes.
SIAM J. Comput., 2013

Association schemes, non-commutative polynomial concentration, and sum-of-squares lower bounds for planted clique.
Electron. Colloquium Comput. Complex., 2013

Moment-Matching Polynomials.
Electron. Colloquium Comput. Complex., 2013

Volumetric Spanners and their Applications to Machine Learning.
CoRR, 2013

DNF sparsification and a faster deterministic counting algorithm.
Comput. Complex., 2013

A PRG for lipschitz functions of polynomials with applications to sparsest cut.
Proceedings of the Symposium on Theory of Computing Conference, 2013

Learning Halfspaces Under Log-Concave Densities: Polynomial Approximations and Moment Matching.
Proceedings of the COLT 2013, 2013

2012
Learning Functions of Halfspaces using Prefix Covers.
Proceedings of the COLT 2012, 2012

Pseudorandomness from Shrinkage.
Electron. Colloquium Comput. Complex., 2012

Better pseudorandom generators from milder pseudorandom restrictions.
Electron. Colloquium Comput. Complex., 2012

DNF Sparsification and a Faster Deterministic Counting.
Electron. Colloquium Comput. Complex., 2012

A PTAS for Computing the Supremum of Gaussian Processes.
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2011
Making the long code shorter, with applications to the Unique Games Conjecture.
Electron. Colloquium Comput. Complex., 2011

An FPTAS for #Knapsack and Related Counting Problems.
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

Almost Optimal Explicit Johnson-Lindenstrauss Families.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

2010
Almost Optimal Explicit Johnson-Lindenstrauss Transformations.
Electron. Colloquium Comput. Complex., 2010

Polynomial-Time Approximation Schemes for Knapsack and Related Counting Problems using Branching Programs.
Electron. Colloquium Comput. Complex., 2010

Almost Optimal Explicit Johnson-Lindenstrauss Transformations
CoRR, 2010

Bounding the average sensitivity and noise sensitivity of polynomial threshold functions.
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

Guaranteed Rank Minimization via Singular Value Projection.
Proceedings of the Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010. Proceedings of a meeting held 6-9 December 2010, 2010

2009
An Invariance Principle for Polytopes.
Electron. Colloquium Comput. Complex., 2009

Matrix Completion from Power-Law Distributed Samples.
Proceedings of the Advances in Neural Information Processing Systems 22: 23rd Annual Conference on Neural Information Processing Systems 2009. Proceedings of a meeting held 7-10 December 2009, 2009

Small-Bias Spaces for Group Products.
Proceedings of the Approximation, 2009

2008
Simultaneous Unsupervised Learning of Disparate Clusterings.
Stat. Anal. Data Min., 2008

Rank minimization via online learning.
Proceedings of the Machine Learning, 2008


  Loading...