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,694 papers · 148 categories

Trend · papers per month

3947891,1831,577 · Jun 202019922001200920172026
48 results for value equivalent models

Investigates set-valued risk measures for processes and vectors, proving equivalence and providing new dual representations.

problem Investigates set-valued risk measures for processes and vectors.
method Utilizes equivalence of risk measures for processes and vectors and their penalty function formulations.
result Provides new dual representation for risk measures for processes in the set-valued framework.

Algorithm finds a simplified model for reinforcement learning under agent limitations.

problem Finding a simple model that approximates the true model for reinforcement learning.
method Uses rate-distortion theory to compute an approximately-value-equivalent, lossy compression of the environment.
result Proves an information-theoretic, Bayesian regret bound for the algorithm.

A new RL approach learns near-equivalent actions for healthcare decisions.

problem Finding optimal actions in healthcare settings where actions may be near-equivalent.
method Temporal difference learning with a near-greedy heuristic for action selection.
result The proposed algorithm discovers meaningful near-equivalent actions and converges well.

This work analyzes self-attention matrices using random matrix theory.

problem Understanding the theoretical behavior of self-attention layers in neural networks.
method Asymptotic spectral analysis of the attention matrix, Gaussian equivalence, and linearization.
result The singular value distribution of the attention matrix is asymptotically characterized by a linear model.

Introduces valuative stability for polarised varieties, equivalent to K-stability.

problem Characterizing K-stability for polarised varieties.
method Introduces valuative stability, equivalent to K-stability for test configurations with integral central fibre.
result Equivalence of valuative stability and K-stability for polarised varieties.

Conditions, related to Kulkarni's equivalence problem are considered for indefinite Riemannian and Kaehlerian manifolds. Corresponding theorems are obtained for the values of the Ricci tensor on isotropic vectors as well as for the values of the curvature tensor on degenerate holomorphic 2-planes.

2010-08-30abs ↗pdf ↗

Pion optimizes LLMs by preserving weight matrix singular values.

problem Training large language models (LLMs) with standard optimizers leads to unstable weight matrices.
method Pion uses orthogonal transformations to update weight matrices, preserving their singular values.
result Pion offers a stable alternative to standard optimizers for LLM pretraining and finetuning.

The future value of a security is described as a random variable. Distribution of this random variable is the formal image of risk uncertainty. On the other side, any present value is defined as a value equivalent to the given future value. This equivalence relationship is a subjective. Thus follows, that present value…

2013-02-03abs ↗pdf ↗

CEFOL uses deep learning for dynamic programming with recursive utility.

problem Challenges in solving dynamic programming problems with recursive utility.
method Introduces a separate neural network for certainty equivalent, uses first-order optimality conditions to learn value and policy functions.
result CEFOL achieves high accuracy in learning value and policy functions, matching VFI benchmarks.

New versions of the set-valued average value at risk for multivariate risks are introduced by generalizing the well-known certainty equivalent representation to the set-valued case. The first "regulator" version is independent from any market model whereas the second version, called the market extension, takes trading …

2012-02-25abs ↗pdf ↗

Equivalent characterizations of multiportfolio time consistency are deduced for closed convex and coherent set-valued risk measures on Lp(Ω,F,P;Rd)L^p(Ω,\mathcal F, P; R^d) with image space in the power set of Lp(Ω,Ft,P;Rd)L^p(Ω,\mathcal F_t,P;R^d). In the convex case, multiportfolio time consistency is equivalent to a cocycle condition on…

2012-12-21abs ↗pdf ↗

Study risk-sensitive reinforcement learning with optimized certainty equivalents.

problem Risk-sensitive reinforcement learning in finite discounted MDPs.
method Analyzed a simple model-based approach and derived PAC sample complexity bounds.
result Established tight sample complexity bounds for value and policy learning.

We define AkA_k-moves for embeddings of a finite graph into the 3-sphere for each natural number kk. Let AkA_k-equivalence denote an equivalence relation generated by AkA_k-moves and ambient isotopy. AkA_k-equivalence implies Ak1A_{k-1}-equivalence. Let F{\cal F} be an Ak1A_{k-1}-equivalence class of the embeddings of …

2001-06-20abs ↗pdf ↗

We analyze the possibility of defining infinite-dimensional manifolds as ringed spaces. More precisely, we consider three definitions of manifolds modeled on locally convex spaces: in terms of charts and atlases, in terms of ringed spaces, and in terms of functored spaces, as introduced by Douady in his thesis. It is s…

2014-03-23abs ↗pdf ↗

Equivalence relations can be defined on Gauss phrases using combinatorial moves. In this paper we consider two closely related equivalence relations on Gauss phrases, homotopy and open homotopy. In particular, in each case, we define a new invariant and determine the values that it can attain.

2008-10-24abs ↗pdf ↗

The following numerical control over the topological equivalence is proved: two complex polynomials in n3n\not= 3 variables and with isolated singularities are topologically equivalent if one deforms into the other by a continuous family of polynomial functions fs ⁣:CnCf_s \colon \mathbb{C}^n \to \mathbb{C} with isolated sin…

2003-09-19abs ↗pdf ↗

We give a global version of Le-Ramanujam mu-constant theorem for polynomials. Let f_t, (t in [0,1]), be a family of polynomials of n complex variables with isolated singularities, whose coefficients are polynomials in t. We consider the case where some numerical invariants are constant (the affine Milnor number, the Mi…

2002-01-15abs ↗pdf ↗

The paper classifies pretzel links with 2 components and gives conditions for those with 3 or more.

problem Classifying pretzel links based on their self delta-equivalence.
method Using Conway polynomials to determine self delta-equivalence for links with 2 or more components.
result Necessary and sufficient conditions for self delta-equivalence of pretzel links with 3 or more components.

Solves Merton's investment-consumption problem with certainty equivalent approach.

problem Maximizing CRRA utility of consumption over time and investment mix.
method Identifies a certainty equivalent problem for the Merton problem, reformulates it as an SOCP, and applies it to model predictive control.
result The certainty equivalent problem can be solved as an SOCP, facilitating model predictive control.

Overview of risk-sensitive Markov decision processes with Optimized Certainty Equivalent.

problem Optimizing decision-making under risk in Markov processes.
method Analyzes risk-sensitive criteria using Optimized Certainty Equivalent, including entropic risk and Conditional Value-at-Risk.
result Conditions for the existence of optimal policies and solution procedures are provided.

This paper shows connections between two complex mathematical theories are equivalent.

problem Establishing equivalence between two complex mathematical theories.
method Using geometric quantisation and conformal field theory, the paper establishes equivalence between the Hitchin connection and the Knizhnik-Zamolodchikov connection.
result The Hitchin and Knizhnik-Zamolodchikov connections are projectively equivalent in genus zero.

We introduce the concept of `claspers,' which are surfaces in 3-manifolds with some additional structure on which surgery operations can be performed. Using claspers we define for each positive integer k an equivalence relation on links called `C_k-equivalence,' which is generated by surgery operations of a certain kin…

2000-01-28abs ↗pdf ↗

Deep learning solves dynamic programming with recursive utility.

problem Challenges in solving high-dimensional discrete-time dynamic programming problems with recursive utility.
method Certainty Equivalent Learning (CEL) algorithm that learns certainty-equivalent value directly with neural networks.
result Accurate value and policy approximations in high-dimensional problems, comparable to VFI in some cases.

Paper discusses directional differentiability of interval-valued functions on Riemannian manifolds.

problem Equivalence of directional differentiability of interval-valued functions and their components.
method Analyzes directional differentiability of interval-valued functions on Riemannian manifolds.
result Directional differentiability of interval-valued functions is not equivalent to the directional differentiability of their components.

Study on implied certainty equivalent rates in financial markets and electric vehicles.

problem Investment risk in financial markets.
method Mathematical derivation of implied certainty equivalent rate, empirical analysis of stock and option data.
result Positive implied certainty equivalent rates are more suitable for investment than negative ones, but higher values increase risk.

Equivalences between conformal foliations on Euclidean 33-space, Hermitian structures on Euclidean 44-space, shear-free ray congruences on Minkowski 44-space, and holomorphic foliations on complex 44-space are explained geometrically and twistorially; these are used to show that 1) any real-analytic complex-valued …

1996-03-13abs ↗pdf ↗

For any link and for any modulus mm we introduce an equivalence relation on the set of non-trivial m-colorings of the link (an m-coloring has values in Z/mZ). Given a diagram of the link, the equivalence class of a non-trivial m-coloring is formed by each assignment of colors to the arcs of the diagram that is obtaine…

2012-08-05abs ↗pdf ↗

We discuss the ribbon-move for 2-knots, which is a local move. Let KK and KK' be 2-knots. Then we have: Suppose that KK and KK' are ribbon-move equivalent. (1) Let TorH1(X~K;Z){\mathrm {Tor}} H_1(\widetilde X_K; {\Z}) (resp. TorH1(X~K;Z){\mathrm {Tor}} H_1(\widetilde X_{K'}; {\Z})) be the Z\Z-torsion submodule of the Alexander module…

2004-07-09abs ↗pdf ↗

This work analyzes centered binary Restricted Boltzmann Machines (RBMs) and binary Deep Boltzmann Machines (DBMs), where centering is done by subtracting offset values from visible and hidden variables. We show analytically that (i) centering results in a different but equivalent parameterization for artificial neural …

2013-11-06abs ↗pdf ↗

We study an optimal liquidation problem under the ambiguity with respect to price impact parameters. Our main results show that the value function and the optimal trading strategy can be characterized by the solution to a semi-linear PDE with superlinear gradient, monotone generator and singular terminal value. We also…

2019-09-02abs ↗pdf ↗