相关论文: Replica bounds for optimization problems and dilut…

Model order reduction (MOR) techniques are often used to reduce the order of spatially-discretized (stochastic) partial differential equations and hence reduce computational complexity. A particular class of MOR techniques is balancing…

In the context of disordered systems with quenched Hamiltonians I address the problem of characterizing rare samples where the thermal average of a specific observable has a value different from the typical one. These rare samples can be…

We study a multi-species spin glass system where the density of each species is kept fixed at increasing volumes. The model reduces to the Sherrington-Kirkpatrick one for the single species case. The existence of the thermodynamic limit is…

We consider random systems of equations x_1 + ... + x_k = a; 0 <= a <= 2 which are interpreted as equations modulo 3: We show for k >= 15 that the satisfiability threshold of such systems occurs where the 2-core has density 1: We show a…

We present a quantum algorithm that has rigorous runtime guarantees for several families of binary optimization problems, including Quadratic Unconstrained Binary Optimization (QUBO), Ising spin glasses ($p$-spin model), and $k$-local…

We establish the uniqueness and regularity of weak (and very weak) solutions to a class of cross diffusion systems which is inspired by models in mathematical biology/ecology, in particular the Shigesada-Kawasaki-Teramoto (SKT) model in…

We consider a class of parameter-dependent optimal control problems of elliptic PDEs with constraints of general type on the control variable. Applying the concept of variational discretization, [4], together with techniques from the…

We consider a variational convex relaxation of a class of optimal partitioning and multiclass labeling problems, which has recently proven quite successful and can be seen as a continuous analogue of Linear Programming (LP) relaxation…

We revisit the replica method for analyzing inference and learning in parametric models, considering situations where the data-generating distribution is unknown or analytically intractable. Instead of assuming idealized distributions to…

The best current estimates of the thresholds for the existence of solutions in random constraint satisfaction problems ('CSPs') mostly derive from the first and the second moment method. Yet apart from a very few exceptional cases these…

We revisit the metastability properties of the mixed p-spin spherical disordered models. Firstly, using known methods, we show that there is temperature chaos in a broad range of temperatures. Secondly, we modify the definition of the…

We suggest a possible approach to proving the M\'ezard-Parisi formula for the free energy in the diluted spin glass models, such as diluted K-spin or random K-sat model at any positive temperature. In the main contribution of the paper, we…

In this paper, we present approximation algorithms for combinatorial optimization problems under probabilistic constraints. Specifically, we focus on stochastic variants of two important combinatorial optimization problems: the k-center…

We consider optimization problems with uncertain constraints that need to be satisfied probabilistically. When data are available, a common method to obtain feasible solutions for such problems is to impose sampled constraints, following…

Variational methods are employed in situations where exact Bayesian inference becomes intractable due to the difficulty in performing certain integrals. Typically, variational methods postulate a tractable posterior and formulate a lower…

We study convergence lower bounds of without-replacement stochastic gradient descent (SGD) for solving smooth (strongly-)convex finite-sum minimization problems. Unlike most existing results focusing on final iterate lower bounds in terms…

This paper considers an optimization problem for a dynamical system whose evolution depends on a collection of binary decision variables. We develop scalable approximation algorithms with provable suboptimality bounds to provide…

In this paper we review some recent rigorous results that provide an essentially complete solution of a class of spin glass models introduced by Derrida in the 1980ies. These models are based on Gaussian random processes on $\{-1,1\}^N$…

Random $K$-satisfiability ($K$-SAT) is a paradigmatic model system for studying phase transitions in constraint satisfaction problems and for developing empirical algorithms. The statistical properties of the random $K$-SAT solution space…

We provide improved upper and lower bounds for the Min-Sum-Radii (MSR) and Min-Sum-Diameters (MSD) clustering problems with a bounded number of clusters $k$. In particular, we propose an exact MSD algorithm with running-time $n^{O(k)}$. We…