pith. sign in

Santosh Vempala

Identifiers

  • name variant Santosh Vempala 0.60 · backfill

Papers (43)

  1. Tight Bounds for Learning Polyhedra with a Margin cs.DS · 2026 · author #2
  2. Human-Usable Password Schemas: Beyond Information-Theoretic Security cs.CR · 2019 · author #2
  3. The Price of Fair PCA: One Extra Dimension cs.LG · 2018 · author #5
  4. Smoothed Analysis of Discrete Tensor Decomposition and Assemblies of Neurons cs.DS · 2018 · author #6
  5. Gradient Descent for One-Hidden-Layer Neural Networks: Polynomial Convergence and SQ Lower Bounds cs.LG · 2018 · author #1
  6. Usability of Humanly Computable Passwords cs.HC · 2017 · author #2
  7. Creation and analysis of biochemical constraint-based models: the COBRA Toolbox v3.0 q-bio.QM · 2017 · author #47
  8. Random Overlapping Communities: Approximating Motif Densities of Large Graphs cs.DM · 2017 · author #2
  9. On the Complexity of Learning Neural Networks cs.LG · 2017 · author #2
  10. The Complexity of Human Computation: A Concrete Model with an Application to Passwords cs.HC · 2017 · author #2
  11. Chi-squared Amplification: Identifying Hidden Hubs cs.LG · 2016 · author #2
  12. Agnostic Estimation of Mean and Covariance cs.DS · 2016 · author #3
  13. A Note on Non-Degenerate Integer Programs with Small Sub-Determinants math.OC · 2016 · author #5
  14. Cortical Computation via Iterative Constructions cs.NE · 2016 · author #3
  15. Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization cs.LG · 2015 · author #3
  16. Query complexity of sampling and small geometric partitions cs.CC · 2014 · author #3
  17. Efficient Representations for Life-Long Learning and Autoencoding cs.LG · 2014 · author #3
  18. Stochastic billiards for sampling from the boundary of a convex set math.PR · 2014 · author #2
  19. Gaussian Cooling and O*(n^3) Algorithms for Volume and Gaussian Volume cs.DS · 2014 · author #2
  20. Subsampled Power Iteration: a Unified Algorithm for Block Models and Planted CSP's cs.DS · 2014 · author #3
  21. Geometric Random Edge cs.DS · 2014 · author #2
  22. Towards Human Computable Passwords cs.CR · 2014 · author #4
  23. On the Complexity of Random Satisfiability Problems with Planted Solutions cs.CC · 2013 · author #3
  24. A Cubic Algorithm for Computing Gaussian Volume cs.DS · 2013 · author #2
  25. Fourier PCA and Robust Tensor Decomposition cs.LG · 2013 · author #2
  26. Principal Component Analysis and Higher Correlations for Distributed Data cs.DS · 2013 · author #2
  27. The Complexity of Approximating Vertex Expansion cs.CC · 2013 · author #3
  28. The Cutting Plane Method is Polynomial for Perfect Matchings cs.DS · 2012 · author #3
  29. Near-Optimal Deterministic Algorithms for Volume Computation and Lattice Problems via M-Ellipsoids cs.CC · 2012 · author #2
  30. Statistical Algorithms and a Lower Bound for Detecting Planted Clique cs.CC · 2012 · author #4
  31. Integer Feasibility of Random Polytopes cs.DS · 2011 · author #2
  32. Many Sparse Cuts via Higher Eigenvalues cs.DS · 2011 · author #4
  33. Deterministic Construction of an Approximate M-Ellipsoid and its Application to Derandomizing Lattice Algorithms cs.CC · 2011 · author #2
  34. Algorithms for Implicit Hitting Set Problems cs.DS · 2011 · author #4
  35. Enumerative Lattice Algorithms in Any Norm via M-Ellipsoid Coverings cs.DS · 2010 · author #3
  36. A Deterministic Polynomial-time Approximation Scheme for Counting Knapsack Solutions cs.DS · 2010 · author #2
  37. The Limit of Convexity Based Isoperimetry: Sampling Harmonic-Concave Functions cs.DS · 2009 · author #3
  38. Random Tensors and Planted Cliques cs.DS · 2009 · author #2
  39. Thin Partitions: Isoperimetric Inequalities and Sampling Algorithms for some Nonconvex Families cs.DS · 2009 · author #3
  40. Logconcave Random Graphs math.CO · 2009 · author #2
  41. Expanders via Random Spanning Trees cs.DM · 2008 · author #3
  42. Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting cs.DS · 2006 · author #2
  43. Dispersion of Mass and the Complexity of Randomized Geometric Algorithms cs.CC · 2006 · author #2

Mentions

  • 1411.3799 #3 · backfill · confidence 0.70 Santosh Vempala
  • 1411.1490 #3 · backfill · confidence 0.70 Santosh Vempala
  • 1410.5775 #2 · backfill · confidence 0.70 Santosh Vempala
  • 1409.6011 #2 · backfill · confidence 0.70 Santosh Vempala
  • 1407.2774 #3 · backfill · confidence 0.70 Santosh Vempala
  • 1404.1568 #2 · backfill · confidence 0.70 Santosh Vempala
  • 1404.0024 #4 · backfill · confidence 0.70 Santosh Vempala
  • 1311.4821 #3 · backfill · confidence 0.70 Santosh Vempala
  • 1306.5829 #2 · backfill · confidence 0.70 Santosh Vempala
  • 1306.5825 #2 · backfill · confidence 0.70 Santosh Vempala
  • 1304.3162 #2 · backfill · confidence 0.70 Santosh Vempala
  • 1304.3139 #3 · backfill · confidence 0.70 Santosh Vempala
  • 1207.5813 #3 · backfill · confidence 0.70 Santosh Vempala
  • 1201.5972 #2 · backfill · confidence 0.70 Santosh Vempala
  • 1201.1214 #4 · backfill · confidence 0.70 Santosh Vempala
  • 1111.4649 #2 · backfill · confidence 0.70 Santosh Vempala
  • 1111.0965 #4 · backfill · confidence 0.70 Santosh Vempala
  • 1107.5478 #2 · backfill · confidence 0.70 Santosh Vempala
  • 1102.1472 #4 · backfill · confidence 0.70 Santosh Vempala
  • 1011.5666 #3 · backfill · confidence 0.70 Santosh Vempala
  • 1008.1687 #2 · backfill · confidence 0.70 Santosh Vempala
  • 0906.2448 #3 · backfill · confidence 0.70 Santosh Vempala
  • 0905.2381 #2 · backfill · confidence 0.70 Santosh Vempala
  • 0904.0583 #3 · backfill · confidence 0.70 Santosh Vempala
  • 0901.3697 #2 · backfill · confidence 0.70 Santosh Vempala
  • 0807.1496 #3 · backfill · confidence 0.70 Santosh Vempala

Frequent Coauthors