Related papers: Global Minimum Depth In Edwards-Anderson Model
We study the convergence of the Augmented Decomposition Algorithm (ADA) proposed in [32] for solving multi-block separable convex minimization problems subject to linear constraints. We show that the global convergence rate of the exact ADA…
Minimum distance estimation (MDE) gained recent attention as a formulation of (implicit) generative modeling. It considers minimizing, over model parameters, a statistical distance between the empirical data distribution and the model. This…
Autoencoders are a popular model in many branches of machine learning and lossy data compression. However, their fundamental limits, the performance of gradient methods and the features learnt during optimization remain poorly understood,…
We study a large family of Riesz-type singular interaction potentials with anisotropy in two dimensions. Their associated global energy minimizers are given by explicit formulas whose supports are determined by ellipses under certain…
Exponential moving average (EMA) has recently gained significant popularity in training modern deep learning models, especially diffusion-based generative models. However, there have been few theoretical results explaining the effectiveness…
The performance of quantum annealing for combinatorial optimization is fundamentally limited by the minimum energy gap $\Delta$ encountered at quantum phase transitions. We investigate the scaling of $\Delta$ with system size $N$ for two…
We study the scaling behavior of the entanglement entropy of two dimensional conformal quantum critical systems, i.e. systems with scale invariant wave functions. They include two-dimensional generalized quantum dimer models on bipartite…
The problem of finding out the global minimum of a multiextremal functional is discussed. One frequently faces with such a functional in various applications. We propose a procedure, which depends on the dimensionality of the problem…
This paper studies a Bayesian approach to non-asymptotic minimax adaptation in nonparametric estimation. Estimating an input function on the basis of output functions in a Gaussian white-noise model is discussed. The input function is…
Global minimization is a fundamental challenge in optimization, especially in machine learning, where finding the global minimum of a function directly impacts model performance and convergence. This article introduces a novel optimization…
We present a benchmark designed to evaluate the predictive capabilities of universal machine learning interatomic potentials across systems of varying dimensionality. Specifically, our benchmark tests zero- (molecules, atomic clusters,…
We present a new Bayesian methodology to learn the unknown material density of a given sample by inverting its two-dimensional images that are taken with a Scanning Electron Microscope. An image results from a sequence of projections of the…
Understanding the loss of information in spectral analytics is a crucial first step towards finding root causes for failures and uncertainties using spectral data in artificial intelligence models built from modern complex data science…
We develop polynomial-time algorithms for near-optimal minimax mean estimation under $\ell_2$-squared loss in a Gaussian sequence model under convex constraints. The parameter space is an origin-symmetric, type-2 convex body $K \subset…
Despite many applications, dimensionality reduction in the $\ell_1$-norm is much less understood than in the Euclidean norm. We give two new oblivious dimensionality reduction techniques for the $\ell_1$-norm which improve exponentially…
The minimum error entropy (MEE) criterion has been successfully used in fields such as parameter estimation, system identification and the supervised machine learning. There is in general no explicit expression for the optimal MEE estimate…
This paper considers nonparametric regression from strongly mixing observations. The proposed approach is based on deep neural networks with minimum error entropy (MEE) principle. We study two estimators: the non-penalized deep neural…
We investigate the local spectral statistics of the loss surface Hessians of artificial neural networks, where we discover excellent agreement with Gaussian Orthogonal Ensemble statistics across several network architectures and datasets.…
The L-distance (especially the 2-distance) minimal dominating set (MDS) problem is widely considered in various dominating set problems. Recently, we studied the regular dominating set problem using the cavity method and developed two…
The critical properties of short-range Ising spin-glass models, defined on a diamond hierarchical lattice of graph fractal dimension $d_{f}=2.58$, 3, and 4, and scaling factor 2 are studied via a method based on the Migdal-Kadanoff…