1 citations · 1 across the 5 of their papers we have counts for
5 papers
Finite Sample Bounds for Learning with Score Matching
Devin Smedira, Abhijith Jayakumar, Sidhant Misra +2
Learning of continuous exponential family distributions with unbounded support remains an important area of research for both theory and applications in high-dimensional statistics…
Integrating High-Dimensional Functions Deterministically
David Gamarnik, Devin Smedira
We design a Quasi-Polynomial time deterministic approximation algorithm for computing the integral of a multi-dimensional separable function, supported by some underlying hyper-gra…
Computing the Volume of a Restricted Independent Set Polytope Deterministically
David Gamarnik, Devin Smedira
We construct a quasi-polynomial time deterministic approximation algorithm for computing the volume of an independent set polytope with restrictions. Randomized polynomial time app…
Graph Coloring and Semidefinite Rank
Renee Mirka, Devin Smedira, David P. Williamson
This paper considers the interplay between semidefinite programming, matrix rank, and graph coloring. Karger, Motwani, and Sudan \cite{KMS98} give a vector program for which a colo…
Scheduling Appointments Online:\\ The Power of Deferred Decision-Making
Devin Smedira, David B. Shmoys
The recently introduced online Minimum Peak Appointment Scheduling (MPAS) problem is a variant of the online bin-packing problem that allows for deferred decision making. Specifica…