We consider vector fixed point (FP) equations in large dimensional spaces involving random variables, and study their realization-wise solutions. We have an underlying directed random graph, that defines the connections between various components of the FP equations. Existence of an edge between nodes i, j implies the …
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
48 results for “random fixed point equations”
New approach to analyze matrix denoising using gradient flow and fixed point equations.
problem Positive semi-definite matrix denoising in extensive-rank and high-dimensional settings.
method Gradient flow and fixed point equations derived from linear pencil techniques of random matrix theory.
result Continuous phase transitions in the extensive-rank and high-dimensional regime.
Model financial network dynamics to avoid systemic risk.
problem Avoid systemic risk in financial networks.
method Model financial network as random liability graph, agents adapt strategies based on learning, analyze using ODE.
result Emerging strategies converge to evolutionary stable strategies (all risky or all less risky agents).
Study optimizes solving fixed-point equations using subspace search.
problem Solving linear fixed point equations in Hilbert spaces.
method Linear stochastic approximation scheme with Polyak--Ruppert averaging.
result Established optimal approximation factor for temporal difference learning methods.
Study on the geometric Dyson Brownian motion of non-square matrix products.
problem Understanding the spectrum of a product of non-square random matrices.
method Proportional depth-width limit followed by mean-field limit, solving Burgers equation.
result Free log-normal law is obtained in the identity-start case.
Intensity Dot Product Graphsstat.ML
IDPGs extend RDPGs with a Poisson process for random latent positions.
problem Modeling randomness in latent positions for graph structure.
method Introduce IDPGs using Poisson point processes on latent Euclidean space.
result Continuous analogues of adjacency matrices link latent structure to observed graphs.
The Bass model is calibrated to vanilla options using a fixed-point equation.
problem Calibration of the Bass local volatility model to vanilla options.
method Solving a fixed-point equation to achieve calibration.
result Existence and uniqueness of the solution to the fixed-point equation, and linear convergence of the fixed-point iteration scheme.
Gromov showed that for fixed, arbitrarily large C, any uniformly C-Lipschitz affine action of a random group in his graph model on a Hilbert space has a fixed point. We announce a theorem stating that more general affine actions of the same random group on a Hilbert space have a fixed point. We discuss some aspects of …
We prove that a random group of the graph model associated with a sequence of expanders has fixed-point property for a certain class of CAT(0) spaces. We use Gromov's criterion for fixed-point property in terms of the growth of n-step energy of equivariant maps from a finitely generated group into a CAT(0) space, to wh…
Model financial network dynamics to avoid systemic risk.
problem Emergence of systemic risk in financial networks.
method Derive solutions of random fixed point equations, analyze replicator dynamics, derive conditions for evolutionary stable strategies, verify with simulations.
result Emerging strategies converge to an attractor of an ODE, avoiding systemic risk.
Mathematical methods characterize RNNs' asymptotics as hidden units and data grow.
problem Characterize recurrent neural networks' behavior as hidden units and data grow.
method Developed mathematical methods to analyze RNNs' convergence to an infinite-dimensional ODE coupled with a fixed point of a random algebraic equation.
result RNNs converge to an infinite-dimensional ODE coupled with a fixed point of a random algebraic equation.
Unified framework for solving fixed-point equations in deterministic and stochastic settings.
problem Solving fixed-point equations for seminorm-contractive operators in both deterministic and stochastic contexts.
method Fixed-point theorem and stochastic approximation analysis.
result Unified finite-sample bounds for various reinforcement learning algorithms.
Classifies Toda-type tt*-structures and their fixed points.
problem Classifying Toda-type tt*-structures and their fixed points.
method Fixed point description and reduction of anti-symmetry conditions.
result Reduces possibilities of anti-symmetry condition to two cases.
Asymptotically almost periodic solutions to parabolic equations on the real hyperbolic manifoldmath.AP
Study asymptotically almost periodic solutions on real hyperbolic manifolds.
problem Existence and asymptotic behavior of solutions to parabolic equations.
method Dispersion and smoothing estimates, fixed point argument.
result Existence and uniqueness of asymptotically almost periodic solutions.
The paper offers a framework to analyze machine learning problems using concentration of measure.
problem Analyzing machine learning algorithms defined by implicit equations.
method Develops a concentration of measure framework to solve convex problems and implicit formulations.
result Provides precise estimations for the first moments of the solution, describing the behavior and performance of machine learning classifiers.
Study solves optimal portfolio selection using HJB equation.
problem Optimal portfolio selection problem.
method Maximal monotone operator method, Banach fixed-point theorem, Fourier transform, monotone operators technique.
result Existence and uniqueness of solution to HJB equation.
In this paper, we introduce new methods for solving the vacuum Einstein constraints equations: the first one is based on Schaefer's fixed point theorem (known methods use Schauder's fixed point theorem) while the second one uses the concept of half-continuity coupled with the introduction of local supersolutions. These…
New approach uses random matrix theory to understand tensor estimation performance.
problem Understanding the performance of estimators for low-rank signals in noisy tensors.
method Developed a new approach using random matrix theory to study random tensors.
result Discovered a fixed-point equation that matches the performance of the maximum likelihood estimator.
New methods for federated learning reduce communication costs.
problem Efficiently solving optimization problems in a distributed setting.
method Developed two strategies for achieving consensus in federated learning: fixed number of local steps and randomized computations.
result Convergence analysis and experiments show benefits of the proposed methods.
This systemic risk paper introduces inhomogeneous random financial networks (IRFNs). Such models are intended to describe parts, or the entirety, of a highly heterogeneous network of banks and their interconnections, in the global financial system. Both the balance sheets and the stylized crisis behaviour of banks are …
New method uses randomized sparse neural networks to solve time-dependent PDEs more accurately and efficiently.
problem Numerical challenges in training neural networks sequentially in time to solve time-dependent PDEs.
method Introduces Neural Galerkin schemes that update randomized sparse subsets of network parameters at each time step.
result Up to two orders of magnitude more accurate and two orders of magnitude faster than dense update schemes.
Study eigenvalue distributions of neural kernels for linear-width networks.
problem Eigenvalue distributions of neural kernels in linear-width networks.
method Asymptotic analysis of Conjugate Kernel and Neural Tangent Kernel under random initialization and approximate orthogonality.
result Eigenvalue distributions converge to deterministic limits, described by recursive fixed-point equations.
The paper proves an inequality for symmetric polynomials under a fixed point measure.
problem An inequality for elementary symmetric polynomials under a fixed point measure of permutations.
method Constructing differential operators to set up a monotone flow.
result The inequality is proven and is sharp.
A faster method for estimating effects in large data using fixed-point trees.
problem Estimating heterogeneous effects in large dimensions with computational efficiency.
method Fixed-point approximation to eliminate Jacobian estimation and speed up GRFs.
result Significant computational efficiency improvement without sacrificing statistical accuracy.
Proves existence of solution to Lichnerowicz equation on non-CMC manifolds.
problem Existence of positive solution to Lichnerowicz equation on non-CMC closed manifolds with supercritical terms.
method Employed a fixed-point argument involving sub- and supersolutions, with conditions on coefficients to prevent classical solutions.
result Proves existence of a positive and essentially bounded solution.
Study fixed-point sets of -actions on quaternionic manifolds.
problem Characterize fixed-point sets and compatible complex structures on quaternionic manifolds.
method Analyze fixed-point sets and derive equations involving first Chern classes.
result Conditions for the existence of hypercomplex structures on quaternionic manifolds.
This paper solves the consumption-investment problem under Epstein-Zin preferences on a random horizon. In an incomplete market, we take the random horizon to be a stopping time adapted to the market filtration, generated by all observable, but not necessarily tradable, state processes. Contrary to prior studies, we do…
Analytic treatment of a trading market modelcond-mat.stat-mech
We mathematically analyze a simple market model where trading at each point in time involves only two agents with the sum of their money being conserved and with neither parties resulting with negative money after the interaction process. The exchange involves random re-distribution among the two players of a fixed fra…
The Jacobi-Maupertuis metric allows one to reformulate Newton's equations as geodesic equations for a Riemannian metric which degenerates at the Hill boundary. We prove that a JM geodesic which comes sufficiently close to a regular point of the boundary contains pairs of conjugate points close to the boundary. We prove…
A new Poisson bracket defined on Poisson structures with applications to fixed points and cohomology.
problem Defining a Poisson bracket on the space of Poisson structures.
method Constructing a Poisson bracket on depending on a volume form, and defining invariant of Poisson structures.
result Invariant of Poisson structures detects unimodularity and related Poisson bracket for symplectic structures.
Belief propagation (BP) is an iterative method to perform approximate inference on arbitrary graphical models. Whether BP converges and if the solution is a unique fixed point depends on both the structure and the parametrization of the model. To understand this dependence it is interesting to find \emph{all} fixed poi…
IGNN captures long-range graph dependencies using fixed-point equations.
problem Limited GNN ability to capture long-range graph dependencies.
method Fixed-point equilibrium equations involving implicitly defined state vectors, leveraging Perron-Frobenius theory and projected gradient descent.
result IGNN consistently captures long-range dependencies and outperforms state-of-the-art GNNs.
Study reveals three limiting regimes for neural network functionals.
problem Understanding the behavior of functionals of random neural networks.
method Central and non-central limit theorems, Hermite expansions, Diagram Formula, Stein-Malliavin techniques.
result Three distinct limiting regimes based on fixed points of covariance function.
Study a market with uncertain informed traders, finding price impact depends on both asset value and informed trader count distribution.
problem Uncertain participation of informed traders in a market with limit orders.
method Characterized equilibrium by a fixed point integral equation, analyzed large order asymptotics, solved numerically.
result Equilibrium price impact depends on both asset value and distribution of informed traders, not just expected number of informed traders.
New method stabilizes DEQ models by regularizing Jacobian of fixed-point equations.
problem Stability and performance of DEQ models.
method Jacobian regularization to stabilize DEQ models.
result Significant stabilization of fixed-point convergence in DEQ models.
FNO-DEQ solves steady-state PDEs as fixed points, outperforming traditional FNOs.
problem Lack of understanding in designing neural network architectures for PDEs.
method Proposes FNO-DEQ, a deep equilibrium architecture that solves steady-state PDEs as fixed points.
result FNO-DEQ outperforms FNO-based architectures in predicting solutions to steady-state PDEs.
A number of problems in statistical physics and computer science can be expressed as the computation of marginal probabilities over a Markov random field. Belief propagation, an iterative message-passing algorithm, computes exactly such marginals when the underlying graph is a tree. But it has gained its popularity as …
Study on random linear programs and their connection to mean widths of random polyhedrons.
problem Characterizing the objectives of random linear programs and their relation to mean widths of random polyhedrons.
method Utilizing random duality theory, the exact characterizations of linear objectives are obtained in a large dimensional context.
result The exact characterizations of the program's objectives are obtained, connecting the objectives to the mean widths of random polyhedrons.
A novel tracking algorithm models dynamic objects as ellipsoids with time-varying orientation.
problem Tracking dynamic objects with time-varying orientation.
method Random matrix framework with variational Bayes for non-linear inference.
result The method outperforms state-of-the-art methods in accuracy and robustness.
We present a method for performing Hamiltonian Monte Carlo that largely eliminates sample rejection for typical hyperparameters. In situations that would normally lead to rejection, instead a longer trajectory is computed until a new state is reached that can be accepted. This is achieved using Markov chain transitions…
New method handles unknown task boundaries in continual learning.
problem Catastrophic forgetting in neural networks.
method Fixed-point equations for online variational Bayes optimization.
result Approximates online Bayes update for non-stationary data.
Neural networks trained with actor-critic algorithms converge to ODEs under weak convergence analysis.
problem Challenges in convergence analysis due to changing data distributions in online learning.
method Geometric ergodicity of data samples, Poisson equation, weak convergence techniques.
result Actor and critic networks converge to solutions of ODEs with random initial conditions.
The paper proves Lipschitz regularity of graph Laplacian eigenvectors on random data clouds.
problem Analyzing the regularity of solutions to graph Laplacian equations on random data points.
method Probabilistic coupling of random walks and interpolation method for point clouds to continuum.
result Graph Laplacian eigenvectors are essentially Lipschitz with constants depending on eigenvalues.
Study on Navier-Stokes equations on non-compact manifolds, proving existence and decay of solutions.
problem Existence and asymptotic behavior of solutions to Navier-Stokes equations on non-compact manifolds.
method Used -dispersive and smoothing estimates of the Stokes semigroup, fixed point arguments, and Gronwall's inequality.
result Established existence and exponential decay of almost periodic and asymptotically almost periodic mild solutions.
Study compares methods for computing hypergradients in machine learning problems.
problem Computing exact hypergradients in machine learning is difficult.
method Investigates reverse mode iterative differentiation and approximate implicit differentiation methods.
result Unified analysis provides iteration complexity bounds and hierarchy of methods.
VR-GHAL method solves stochastic fixed-point equations with high probability.
problem Solving stochastic fixed-point equations in normed spaces with nonexpansive or contractive operators.
method VR-GHAL, a variance-reduced gradual Halpern method for quadratically smoothable Banach spaces, using clipped stochastic differences.
result The method achieves a high-probability residual bound, reducing the residual nearly geometrically across epochs.
Reconstructing signature features from randomized vector fields in differential equations.
problem Reconstructing signature features from controlled differential equations with random vector fields.
method Using controlled ordinary differential equations driven by continuous bounded variation curves, the study explores the extent to which signature features can be reconstructed from the non-linear flow of these equations.
result The number of signature features that can be reconstructed from the non-linear flow of controlled ordinary differential equations with random vector fields is exponential in the hidden dimension, under certain conditions.
Paper proves new method for constructing initial data in general relativity.
problem Proving the existence of solutions for initial data in general relativity.
method Using the Banach fixed point theorem to prove existence, with guarantees of uniqueness and explicit construction.
result Guaranteed uniqueness and explicit construction of solutions to the conformal method equations.