New research suggests deep networks converge to saddle points with high degeneracy.
problem Understanding the convergence of deep neural networks to saddle points.
method Empirical studies and theoretical findings to validate the hypothesis.
result Deep neural networks converge to saddle points with high degeneracy, not just local minima.
Study of correlated Wigner matrices with BBP transitions.
problem Understanding spectral transitions in correlated Wigner matrices.
method Analyzes a Wigner-type matrix with row/column correlations, decomposes into bulk and outliers, and uses integral operators to model transitions.
result Correlated Wigner matrices exhibit multiple BBP transitions at critical points.
Study on eigenvalue distribution of correlated time series deforming the semi-circle law.
problem Eigenvalue distribution of correlated time series differs from the semi-circle law.
method Analysis of Wigner random matrix with temporal correlation.
result Eigenvalue distribution converges to a deformed semi-circle law with longer tail and higher peak.
The paper studies neural networks with wide layers and finds a deformed semicircle law.
problem Investigating spectral distributions of neural networks in the ultra-wide regime.
method Analyzes empirical kernel matrices, proves deformed semicircle law, provides nonlinear Hanson-Wright inequality.
result Emergence of a deformed semicircle law in the ultra-wide neural network regime.
GRAMPA algorithm recovers latent vertex correspondence in correlated graphs with high probability.
problem Recovering latent vertex correspondence between unlabeled, edge-correlated weighted graphs.
method Spectral graph matching algorithm, GRAMPA, with exact recovery guarantees for Erdős-Rényi graphs.
result GRAMPA exactly recovers latent vertex correspondence with high probability for Erdős-Rényi graphs with edge correlation coefficient 1−σ2 and average degree at least polylog(n) when σ≲1/polylog(n). Study curve shortening flow in high dimensions with boundary constraints.
problem Understanding the behavior of curves in high-dimensional spaces with boundary conditions.
method Used curvature and higher-derivative estimates, Stahl-type maximum principle, and blow-up analysis.
result Flow converges to a shrinking semicircle model or has only semicircle boundary singularities in low entropy regimes.
SPQR improves Q-ensemble diversity in reinforcement learning.
problem Overestimation bias in Q-learning for complex tasks.
method Introduces SPQR for Q-ensemble independence regularization.
result SPQR outperforms baseline algorithms in online and offline RL benchmarks.
Study on utility maximization with Tsallis entropy in reinforcement learning.
problem Exploring utility maximization with Tsallis entropy in reinforcement learning.
method Introducing Tsallis entropy regularizer to induce exploration, investigating specific examples, characterizing well-posedness, designing reinforcement learning algorithm.
result Characterized well-posedness and provided semi-closed-form solutions for specific examples, found distinct optimal strategies.
Researchers found the Wigner derivative and its inverse are equal for spherical tetrahedra.
problem Computing the relationship between dihedral angles and edge lengths in tetrahedra.
method Computed the Wigner derivative and its inverse for spherical tetrahedra.
result The Wigner derivative and its inverse are equal for spherical tetrahedra.
The paper examines singular points in Wigner caustics and affine equidistants of planar curves.
problem Analyzing singular points in Wigner caustics and affine equidistants of planar curves.
method Generalizing the Blaschke-Süss theorem to study convex curves and their antipodal pairs.
result Existence of antipodal pairs in convex curves is generalized.
In this paper we study global properties of the Wigner caustic of parameterized closed planar curves. We find new results on its geometry and singular points. In particular, we consider the Wigner caustic of rosettes, i.e. regular closed parameterized curves with non-vanishing curvature. We present a decomposition of a…
We show that, for each alpha in the interval (-1,1), the only Riemannian metrics on the space of positive definite matrices for which the alpha and -alpha-connections are mutually dual are matrix multiples fo the Wigner-Yanase-Dyson metric. If we further impose that the metric be monotone, then this set is reduced to s…
Wigner's theorem asserts that an isometric (probability conserving) transformation on a quantum state space must be generated by a Hamiltonian that is Hermitian. It is shown that when the Hermiticity condition on the Hamiltonian is relaxed, we obtain the following complex generalisation of Wigner's theorem: a holomorph…
Optimal spectral method found for inhomogeneous spiked Wigner model.
problem Structured noise in learning scenarios.
method Random matrix theory and spectral analysis.
result Optimal threshold for phase transition in block-structured Wigner model.
Signatures of universality are detected by comparing individual eigenvalue distributions and level spacings from financial covariance matrices to random matrix predictions. A chopping procedure is devised in order to produce a statistical ensemble of asset-price covariances from a single instance of financial data sets…
Extends Wigner's representation to study super hyperbolic geometry.
problem Understanding geometry in super hyperbolic three-space.
method Extended Wigner's representation of the Lorentz group to OSp_C(1|2) and applied to Minkowski (3,1|4)-dimensional super space.
result Proof of divergence of the volume of a typical ideal tetrahedron in super hyperbolic three-space.
A novel method computes Wigner kernels for atomic environments, achieving state-of-the-art accuracy.
problem Efficiently describing local atomic environments in materials science.
method Computes fully equivariant and body-ordered kernels iteratively, independent of basis.
result Achieves state-of-the-art accuracy on the QM9 benchmark dataset.
We consider properties of the measurement intensity ρ of a random variable for which the probability density function represented by the corresponding Wigner function attains negative values on a part of the domain. We consider a simple economic interpretation of this problem. This model is used to present the applic…
Consistent model selection for spiked Wigner model via AIC-type criteria.
problem Estimating the number of spiked eigenvalues in the spiked Wigner model.
method AIC-type model selection criteria with parameters γ.
result Strong consistency for γ > 2 and weak consistency for γ = 2 + δ_N.
A test for weak signal detection in noisy data matrices.
problem Detecting a weak signal in a noisy Wigner matrix when the signal-to-noise ratio is small.
method Utilizes linear spectral statistics and hypothesis testing on the data matrix.
result The proposed test is optimal when the noise is Gaussian and can be improved with known noise density.
Study detects signals in spiked Wigner models using log likelihood ratio.
problem Detecting signals in rank-one spiked Wigner models with non-Gaussian noise.
method Proved asymptotic normality of log likelihood ratio and computed error thresholds.
result Optimal signal-to-noise ratio threshold for reliable detection.
Study on limits of detecting a rank-one perturbation in Wigner matrices.
problem Detecting an additive rank-one perturbation in Wigner matrices.
method Gaussian interpolation methods and rigorous incarnation of the cavity method.
result Established the maximal region of contiguity between planted and null models, marking a phase transition for both estimation and detection.
Affine λ-equidistants of convex polygons with parallel opposite sides have applications to isoperimetric inequalities.
problem Reconstruction and area estimates for affine λ-equidistants of convex polygons with parallel opposite sides. method Using Wigner caustics and centre symmetry sets.
result Proving a discrete version of the improved isoperimetric inequality.
On the manifold of positive definite matrices, we investigate the existence of pairs of flat affine connections, dual with respect to a given monotone metric. The connections are defined either using the α-embeddings and finding the duals with respect to the metric, or by means of contrast functionals. We show that i…
Extends particle classification to curved space-times using groupoids.
problem Classifying elementary particles in curved space-time.
method Developed a new definition of elementary particles as irreducible projective representations of kinematical groupoids, extending Wigner's program.
result Classification of elementary particles valid for a wide range of space-times, including new massless particles in magnetic-like backgrounds.
Paper develops new method for detecting latent structure in large symmetric data matrices.
problem Testing for latent structure in large symmetric data matrices.
method Introduces Wilcoxon--Wigner random matrices based on normalized rank statistics.
result Establishes asymptotic Gaussian fluctuations for leading eigenvalue and eigenvector of Wilcoxon--Wigner matrices.
We present an original and novel method based on random matrix approach that enables to distinguish the respective role of temporal autocorrelations inside given time series and cross correlations between various time series. The proposed algorithm is based on properties of Wigner eigenspectrum of random matrices inste…
Study asymptotics of unitary matrix elements in quantum mechanics.
problem Asymptotic behavior of unitary matrix elements in quantum mechanics.
method Uses Berezin-Toeplitz quantization and symplectic geometry.
result Recover asymptotics of Wigner's d-matrix elements for spin representations.
Study reveals an equivalence principle for the spectrum of random inner-product kernel matrices in polynomial scaling.
problem Understanding the spectrum of random kernel matrices in polynomial scaling regimes.
method Investigates random matrices with nonlinear kernel functions applied to inner products of uniformly distributed vectors.
result The spectrum of the random kernel matrix is asymptotically equivalent to a simpler matrix model through free additive convolution.
Study optimal algorithms for recovering signals through inhomogeneous low-rank channels.
problem Recovering signals through an inhomogeneous low-rank matrix channel.
method Derive and analyze an approximate message-passing algorithm (AMP) and a spectral method.
result The AMP iteration matches the conjectured optimal computational phase transition.
The classical isoperimetric inequality in the Euclidean plane R2 states that for a simple closed curve M of the length LM, enclosing a region of the area AM, one gets \begin{align*} L_{M}^2\geqslant 4πA_{M}. \end{align*} In this paper we present the improved isoperimetric inequality, which state…
A curve around a sphere must be at least 4π long.
problem Finding the shortest closed curve that encloses a sphere.
method Analyzing curves in Euclidean 3-space and comparing their lengths.
result The shortest curve is composed of 4 semicircles arranged like a baseball seam.
We prove that either the images of the mapping class groups by quantum representations are not isomorphic to higher rank lattices or else the kernels have a large number of normal generators. Further we show that the images of the mapping class groups have nontrivial 2-cohomology, at least for small levels. For this pu…
Study on complexity of random polynomials with deterministic spikes, identifying phase transitions.
problem Complexity of random Gaussian polynomials with deterministic spikes on a sphere.
method Variational formulas, Kac-Rice formula, determinant asymptotics of finite-rank perturbation of Gaussian Wigner matrices.
result Identification of a topological phase transition in the complexity function.
A new geometric approach to quantum mechanics simplifies time-dependent problems.
problem Quantum mechanics ambiguities in time and observer choices.
method Generally covariant phase-spacetime coordinates and geometric flatness condition.
result Quantum mechanics becomes purely geometric and potentially topological.
New matrix ensembles better match deep neural network spectral densities.
problem Theoretical spectral density models for deep networks do not match empirical observations.
method Introduced new matrix ensemble classes to better fit observed spectral densities.
result Theoretical models for deep networks are significantly flawed.
PPM improves graph matching for correlated Gaussian Wigner models with high probability.
problem Graph matching in the Correlated Gaussian Wigner model with edge correlations.
method Seeded projected power method (PPM) for iterative improvement of initial partial matches.
result PPM recovers ground-truth matching with high probability in O(log n) iterations if seed is close enough.
Paper tackles robust graph matching in dense graphs with AMP type algorithm.
problem Matching recovery between correlated Gaussian Wigner matrices with adversarial perturbations.
method Approximate Message Passing (AMP) type iterative algorithm with time-dependent matrix multiplication.
result Algorithm succeeds in polynomial time for non-vanishing correlation and small perturbations.
Optimal test for detecting signal in noisy matrix model.
problem Signal detection in noisy matrix models with unknown rank.
method Hypothesis test based on linear spectral statistics, optimal under Gaussian noise.
result Optimal test under Gaussian noise, improved with non-Gaussian noise.
Study Liouville action on quasi-Fuchsian groups, proving formulas and relating to holography.
problem Analyzing Liouville action for quasi-Fuchsian groups with different types of elements.
method Derived formulas for classical Liouville action, proved first and second variations, and established holography principle.
result Established an equality linking Liouville action and renormalized volume for quasi-Fuchsian groups.
The manipulation of LIBOR by a group of banks became one of the major blows to the remaining confidence in financial industry. Yet, despite an enormous amount of popular literature on the subject, rigorous time-series studies are few. In my paper, I discuss the following hypothesis. Namely, if we should assume for a st…
The paper sets thresholds for testing correlation in hypergraphs, distinguishing between independent and correlated states.
problem Testing correlation between two hypergraphs under different models.
method Derives sharp information-theoretic thresholds for distinguishing between null and alternative hypotheses.
result The testing threshold decreases as the hypergraph's uniformity (m) increases, making correlation testing easier for higher uniformity.
Paper studies vertex correspondence recovery in correlated graphs with node features.
problem Recovering hidden vertex correspondence between two correlated graphs with observed edge weights and node features.
method Introduced featured correlated Gaussian Wigner model and proposed QPAlign algorithm for quadratic programming relaxation.
result Characterized optimal information-theoretic thresholds for exact and partial recovery of latent mapping.
The main result in this paper is that the space of all smooth links in Euclidean 3-space isotopic to the trivial link of n components has the same homotopy type as its finite-dimensional subspace consisting of configurations of n unlinked Euclidean circles (the "rings" in the title). There is also an analogous result f…
Paper proposes new methods for improving interatomic potentials.
problem Limitations of conventional SO(2) Linear architectures in MLIPs.
method Direct Cartesian construction, recursive Clebsch-Gordan construction, Edge Complex Product Basis, Radial Rotary Complex Attention.
result TECE-OAM-RRA-1.0 achieves SOTA performance on Matbench Discovery.
Simplified Ricci curvature for spherical fluid dynamics models.
problem Studying stability in incompressible fluid dynamics on a sphere.
method Definition and calculation of Ricci curvature for two-dimensional hydrodynamics using finite-dimensional Zeitlin models.
result Strong numerical evidence suggests convergence of finite-dimensional approximations to infinite-dimensional limit, indicating average instability for high-frequency modes.
Wide neural networks converge to Gaussian processes, with implications for kernel behavior and gradient dynamics.
problem Understanding the behavior of wide neural networks and their convergence to Gaussian processes.
method Introducing a tensor program framework to study scaling limits of neural networks, characterizing their behavior under large tensor sizes and randomization.
result Wide neural networks converge to Gaussian processes, with implications for kernel behavior and gradient dynamics.
Algorithm detects and estimates correlated signals in spiked matrices.
problem Detect and estimate correlated signals in spiked matrices.
method Proposes an efficient algorithm based on counting edge-decorated cycles.
result Algorithm succeeds under certain signal-to-noise ratio conditions.