Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

105210315420 · Jun 202019922001200920172026
48 results for parameterized field theories

The paper defines strong emergence in field theories and proves it exists between certain theories.

problem Defining and proving the existence of strong emergence phenomena between field theories.
method Formal definition and sufficient conditions for emergence, proving existence in Euclidean background.
result Strong emergence exists between certain parameterized Lagrangian field theories.

The paper axiomatizes strong emergence in parameterized field theories and proves existence theorems.

problem Formalizing and proving existence of strong emergence in parameterized field theories.
method Axiomatization and proof of existence theorems for strong emergence between Lagrangian field theories.
result Existence of strong emergence phenomena between parameterized Lagrangian field theories.

In this article we present a natural generalization of Newton's Second Law valid in field theory, i.e., when the parameterized curves are replaced by parameterized submanifolds of higher dimension. For it we introduce what we have called the geodesic kk-vector field, analogous to the ordinary geodesic field and which …

2018-11-13abs ↗pdf ↗

Study examines infinite limits of transformer dynamics, identifying key parameterizations.

problem Understanding the training dynamics of transformer models in the feature learning regime.
method Analysis of infinite scaling limits using dynamical mean field theory.
result Identified parameterizations that admit well-defined infinite width and depth limits.

Introduces a neural network-based method for efficient state and parameter estimation in complex systems.

problem Efficiently estimating state paths and parameters from noisy measurements in high-dimensional nonlinear systems.
method Bayesian Information Field Theory with neural network parameterization and optimization algorithms.
result Proposes a method to simplify and enrich state path parameterizations using neural networks, improving inference accuracy.

Residual networks with depthwise hyperparameter scaling transfer optimal hyperparameters across width and depth.

problem The challenge of hyperparameter tuning in deep learning, especially for large models.
method Combining μμP parameterization with residual networks having a residual branch scale of 1/extdepth1/\sqrt{ ext{depth}}.
result Optimal hyperparameters transfer across width and depth in residual networks trained with this parameterization.

Constructs maps from field theories to complexified K-theory and elliptic cohomology.

problem Identifying geometric models for Chern characters in supersymmetric field theories.
method Higher-dimensional generalization of Fei Han's method, involving super moduli spaces and derived geometry.
result Provides evidence for the Stolz--Teichner program and geometric models for Chern characters.

Study bounds graph neural networks' over-parameterized error.

problem Understanding graph neural networks' performance in over-parameterized regimes.
method Developed mean-field regime bounds for graph convolutional and message passing neural networks.
result Established upper bounds with a convergence rate of O(1/n)O(1/n) for generalization error.

Chas and Sullivan have defined an intersection-type product on the homology of the free loop space LM of an oriented manifold M. In this paper we show how to extend this construction to a topological conformal field theory of degree d. In particular, we get operations on the homology of LM which are parameterized by th…

2007-11-30abs ↗pdf ↗

Compact parameterization improves Bayesian neural network performance.

problem Improving performance of Bayesian neural networks using variational methods.
method Restricting variational distribution to a k-tied Normal distribution with low-rank factorization.
result Compact parameterization improves signal-to-noise ratio and convergence speed.

Deep neural networks (DNNs) have demonstrated dominating performance in many fields; since AlexNet, networks used in practice are going wider and deeper. On the theoretical side, a long line of works has been focusing on training neural networks with one hidden layer. The theory of multi-layer networks remains largely …

2018-11-09abs ↗pdf ↗

The study analyzes deep linear networks from random initialization, capturing dynamics and hyperparameter effects.

problem Understanding training dynamics in deep linear networks from random initialization.
method Theoretical analysis of gradient descent dynamics in deep linear networks with random initialization and large data.
result Captures the 'wider is better' effect and hyperparameter transfer effects, contrasting with neural-tangent parameterization.

Gradient flows for surface energies with tensor fields are derived and analyzed.

problem Deriving consistent gradient flows for surface energies involving tensor fields.
method Introducing different gauges of surface independence and demonstrating their effects on energy decrease.
result Consistent choice of gauge and time derivative is necessary for energy decrease.

New scaling framework for MoE architectures ensures stability and optimal performance at scale.

problem Lack of principled understanding of how hyperparameters should scale in MoE architectures.
method Developed a novel Dynamical Mean Field Theory (DMFT) for three scaling regimes of MoE architectures.
result Derived Maximally Scale-Stable Parameterization (MSSP) for SGD and Adam, providing robust learning rate transfer and monotonic improvement with scale.

New bounds show BBVI's gradient variance matches SGD conditions, improving parameterization efficiency.

problem Understanding and improving the convergence of black-box variational inference (BBVI).
method Showed BBVI satisfies matching gradient variance bounds corresponding to the ABC condition for smooth and quadratically-growing log-likelihoods.
result Proven BBVI's gradient variance matches SGD conditions, with superior dimensional dependence for mean-field parameterization.

Local convergence theory for mildly over-parameterized neural nets.

problem Understanding why over-parameterization works in neural networks.
method Developed a local convergence theory for two-layer neural nets, showing neuron convergence under certain conditions.
result All student neurons converge to one of teacher neurons when the loss is below a threshold.

Enhances quantum sensing by eliminating multiple oscillations in field amplitude estimation.

problem Multiple oscillations in field amplitude estimation due to inter-qubit interactions at high qubit densities.
method Adopting a quantum circuit learning framework to approximate a target function by optimizing gate parameters.
result Elimination of multiple oscillations, leading to enhanced dynamic range of quantum sensing.

This is a survey of the theory of complex projective (CP^1) structures on compact surfaces. After some preliminary discussion and definitions, we concentrate on three main topics: (1) Using the Schwarzian derivative to parameterize the moduli space (2) Thurston's parameterization of the moduli space using grafting (3) …

2009-02-11abs ↗pdf ↗

New methods solve tensor-on-tensor regression with unknown rank, revealing benefits of over-parameterization.

problem Connecting tensor responses to tensor covariates with unknown intrinsic rank.
method Riemannian gradient descent and Riemannian Gauss-Newton methods for tensor-on-tensor regression.
result Riemannian optimization methods converge linearly and quadratically to a statistically optimal estimate in rank over-parameterized settings.

Let G be a compact Lie group. By work of Chataur and Menichi, the homology of the space of free loops in the classifying space of G is known to be the value on the circle in a homological conformal field theory. This means in particular that it admits operations parameterized by homology classes of classifying spaces o…

2013-08-28abs ↗pdf ↗

This paper introduces a new bound to explain generalization in over-parameterized models.

problem Understanding why some over-parameterized models generalize well while others do not.
method PAC-Chernoff bounds and smoothness measures based on large deviation theory.
result Interpolators with smoother structures generalize better, according to the new theoretical framework.

The paper explores how over-parameterized linear regression models generalize without violating learning theory principles.

problem Understanding how over-parameterized linear regression models generalize without violating learning theory principles.
method The paper uses the predictive normalized maximum likelihood (pNML) learner to investigate the minimum norm solution of over-parameterized linear regression models.
result The model generalizes well when the test sample lies in a subspace spanned by eigenvectors associated with large eigenvalues of the training data.

This paper presents a method to compute the {\it quasi-conformal parameterization} (QCMC) for a multiply-connected 2D domain or surface. QCMC computes a quasi-conformal map from a multiply-connected domain SS onto a punctured disk DSD_S associated with a given Beltrami differential. The Beltrami differential, which me…

2014-03-26abs ↗pdf ↗

Surface parameterizations have been widely used in computer graphics and geometry processing. In particular, as simply-connected open surfaces are conformally equivalent to the unit disk, it is desirable to compute the disk conformal parameterizations of the surfaces. In this paper, we propose a novel algorithm for the…

2014-08-29abs ↗pdf ↗

Knoop enhances variable selection with over-parameterization and knockoffs.

problem Challenges of variable selection in high-dimensional datasets.
method Generates knockoff variables, integrates them into an over-parameterized model, and uses anomaly-based significance tests.
result Superior performance in variable selection compared to existing methods.

Novel PCA method for high-dimensional inverse problems.

problem Optimizing large-scale random fields with gradient information.
method Gradient-Sensitive Principal Component Analysis (Gradient-SPCA) that modifies PCA using objective function gradients.
result Improvements in encoding quality for objective function minimization and field distribution.

New framework for better mapping of surfaces onto ellipsoids.

problem Mapping genus-0 closed surfaces onto spheres results in large distortion.
method Combining conformal and quasi-conformal mappings onto ellipsoids.
result Achieved a variety of ellipsoidal parameterizations with bijectivity.

Develops spherical density-equalizing maps for closed surfaces.

problem Lack of methods for genus-0 closed surfaces.
method Conformal parameterization onto unit sphere, density equalization, quasi-conformal theory, harmonic energy, landmark constraints.
result Landmark-aligned spherical density-equalizing maps balancing different distortion measures.

The study examines spectral dynamics in deep neural networks, predicting how outliers evolve during training.

problem Understanding spectral evolution in deep neural networks during training.
method Developed a two-level dynamical mean-field theory (DMFT) to track spectral dynamics.
result The theory predicts how outliers evolve with training time, width, output scale, and initialization variance.

We describe the sample paths of the stochastic field F=Ft(v,x,q)F = F_t(v,x,q) of aggregate utilities parameterized by Pareto weights vv and total cash amounts xx and stocks' quantities qq in an economy. We also describe the sample paths of the stochastic field G=Gt(u,y,q)G = G_t(u,y,q), which is conjugate to FF with respect to the …

2013-10-28abs ↗pdf ↗

Determinantal point processes (DPPs), which arise in random matrix theory and quantum physics, are natural models for subset selection problems where diversity is preferred. Among many remarkable properties, DPPs offer tractable algorithms for exact inference, including computing marginal probabilities and sampling; ho…

2012-02-14abs ↗pdf ↗