Fetching the paper…

Reading the bibliography…

2013

Regularly random duality

Stojnic, Mihailo

Original
PDF
Post on X

Understand

In this paper we look at a class of random optimization problems.

We discuss ways that can help determine typical behavior of their solutions.
When the dimensions of the optimization problems are large such an information often can be obtained without actually solving the original problems.
Moreover, we also discover that fairly often one can actually determine many quantities of interest (such as, for example, the typical optimal values of the objective functions) completely analytically.

Regularly random duality · Around

Built on

Eine neue herleitung des exponentialgesetzes in der wahrscheinlichkeitsrechnung
J. W. Lindeberg · 1922
Earlier work this paper cites.
On Milman’s inequality and random subspaces which escape through a mesh in R n {R}^{n}
Y. Gordon · 1988
Earlier work this paper cites.

Similar

Convex Optimization
S. Boyd and L. Vandenberghe · 2003
Cited alongside, same era.
Various thresholds for ℓ 1 \ell_{1} -optimization in compressed sensing
Original
M. Stojnic · 2009
Cited alongside, same era.
Upper-bounding ℓ 1 \ell_{1} -optimization weak thresholds
M. Stojnic
Cited in the paper.

Then

A generalization of the Lindenberg principle
S. Chatterjee · 2076
Closest in time.

Beyond the bibliography

alphaXiv searches the wider corpus for related work and actual follow-ups.

Open on alphaXiv

alphaXiv is searching for related work…