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

Trend · papers per month

55110165220 · Jun 202019922001200920172026
48 results for Variational Outer Loop

Two adaptive kernel selection methods improve the accuracy of Kernelized Diffusion Maps.

problem Selecting an appropriate kernel for Kernelized Diffusion Maps.
method Two complementary approaches: variational outer loop and unsupervised cross-validation.
result Both methods improve the quality and stability of the recovered eigenfunctions.

A new method for efficient nested Monte Carlo simulations in financial modeling.

problem Computational challenges in nested stochastic modeling for financial risk assessment.
method Sample recycling approach to speed up inner loop estimations.
result Significantly more efficient than traditional techniques.

We leverage automatic differentiation (AD) and probabilistic programming to develop an end-to-end optimization algorithm for batch triangulation of a large number of unknown objects. Given noisy detections extracted from noisily geo-located street level imagery without depth information, we jointly estimate the number …

2018-11-21abs ↗pdf ↗

In this paper we study the convexity properties of geodesics and balls in Outer space equipped with the Lipschitz metric. We introduce a class of geodesics called balanced folding paths and show that, for every loop αα, the length of αα along a balanced folding path is not larger than the maximum of its lengths at th…

2017-08-16abs ↗pdf ↗

PDA method optimizes neural networks with global convergence rate analysis.

problem Quantitative convergence rate for neural network optimization in mean field regime.
method Particle dual averaging (PDA) method, combining Langevin algorithm and outer loop optimization.
result Established quantitative global convergence for two-layer mean field neural networks.

The stochastic block model (SBM) is a generative model revealing macroscopic structures in graphs. Bayesian methods are used for (i) cluster assignment inference and (ii) model selection for the number of clusters. In this paper, we study the behavior of Bayesian inference in the SBM in the large sample limit. Combinin…

2016-02-06abs ↗pdf ↗

Efficient hybrid method for pricing barrier options with stochastic volatility.

problem Valuation of barrier options on assets with stochastic volatility.
method Combining Monte Carlo simulation and semi-analytical heat potential method.
result Our method provides better accuracy and is orders of magnitude faster than existing methods.

Eight different refinements of trapped surfaces are proposed, of three basic types, each intended as potential stability conditions. Minimal trapped surfaces are strictly minimal with respect to the dual expansion vector. Outer trapped surfaces have positivity of a certain curvature, related to surface gravity. Increas…

2009-06-14abs ↗pdf ↗

Develops multi-modal neural network models for improved prediction and uncertainty quantification.

problem Improving prediction accuracy and uncertainty quantification for multi-modal data.
method Multi-modal Bayesian neural network models with conjugate last-layer estimation using SVI.
result Improved prediction accuracy and uncertainty quantification compared to uni-modal models.

We solve the Plateau problem for marginally outer trapped surfaces in general Cauchy data sets. We employ the Perron method and tools from geometric measure theory to force and control a blow-up of Jang's equation. Substantial new geometric insights regarding the lower order properties of marginally outer trapped surfa…

2007-11-27abs ↗pdf ↗

Paper introduces a new outer measure for continuous price paths with instant enforcement.

problem Defining a new outer measure for continuous price paths with instant enforcement.
method Introducing an outer measure on the space [0,+)imesΩ[0, +\infty) imes \Omega that assigns zero value to instantly blockable sets.
result Proves BDG inequalities and an Itô-type integral for the modified measure.

This paper analyzes the impact of loops on bilevel optimization efficiency.

problem The impact of loops on the efficiency of bilevel optimization algorithms.
method Unified convergence analysis and computational complexity characterization for AID-BiO and ITD-BiO with and without loops.
result Loops in bilevel optimization can improve overall efficiency but increase per-step complexity.

A core capability of intelligent systems is the ability to quickly learn new tasks by drawing on prior experience. Gradient (or optimization) based meta-learning has recently emerged as an effective approach for few-shot learning. In this formulation, meta-parameters are learned in the outer loop, while task-specific m…

2019-09-10abs ↗pdf ↗

We consider the existence of bibundles, in other words locally trivial principal GG spaces with commuting left and right GG actions. We show that their existence is closely related to the structure of the group $\Out(G)$ of outer automorphisms of GG. We also develop a classifying theory for bibundles. The theory is …

2011-02-22abs ↗pdf ↗

QuantAgent learns trading signals through self-improvement.

problem Building domain-specific knowledge for LLMs in quantitative investment.
method Two-layer loop approach: inner loop refines responses, outer loop tests and learns.
result QuantAgent approximates optimal trading behavior with provable efficiency.

Improved penalty-based methods for bilevel optimization with reduced complexity.

problem Suboptimal complexity in solving bilevel optimization problems with large penalty terms.
method Novel penalty reformulation that decouples upper and lower-level variables, enabling larger step sizes and reduced iteration complexity.
result PBGD-Free algorithm that avoids inner loops for coupled constraint BLO problems, with reduced iteration complexity.

Using Vovk's outer measure, which corresponds to a minimal superhedging price, the existence of quadratic variation is shown for "typical price paths" in the space of càdlàg functions possessing a mild restriction on the jumps directed downwards. In particular, this result includes the existence of quadratic variation …

2016-09-08abs ↗pdf ↗

A method for fair representation learning through bi-level optimization and implicit differentiation.

problem Ensuring fair predictors invariant across sub-groups.
method Bi-level optimization with inner-loop for invariant predictors, implicit path alignment for efficiency.
result Consistently better trade-off in prediction performance and fairness measurement.

Novel algorithm reduces computational burden in IRL with finite-time guarantees.

problem Efficiently recover reward function and optimal policy from expert behavior.
method Single-loop algorithm that maximizes likelihood after each policy improvement step.
result Algorithm provably converges to a stationary solution with finite-time guarantees.

We consider the problem of defining the structure of a smooth manifold on the various spaces of piecewise-smooth loops in a smooth finite dimensional manifold. We succeed for a particular type of piecewise-smooth loops. We also examine the action of the diffeomorphism group of the circle. It is not a useful action on t…

2008-03-05abs ↗pdf ↗

Improved UIVI method shows better performance than state-of-the-art SIVI methods.

problem Estimating the likelihood of samples from complex distributions in high dimensions.
method Replaced the inner MCMC loop of UIVI with importance sampling and learned the optimal proposal distribution.
result The refined UIVI approach demonstrates superior performance or parity with state-of-the-art methods.

Construct quaternionic-Kähler metrics from special Kähler manifolds with specific BPS structure variations.

problem Construct quaternionic-Kähler metrics from special Kähler manifolds with mutually local variations of BPS structures.
method Construct quaternionic-Kähler metrics from a conical special Kähler manifold with a certain type of mutually-local variation of BPS structures. Provide global and local explicit formulas for the quaternionic-Kähler metric.
result Construct quaternionic-Kähler metrics that are positive-definite and deform the 1-loop corrected Ferrara-Sabharval metric.

We introduce a new geometric evolution equation for hypersurfaces in asymptotically flat spacetime initial data sets, that unites the theory of marginally outer trapped surfaces (MOTS) with the study of inverse mean curvature flow in asymptotically flat Riemannian manifolds. A theory of weak solutions is developed usin…

2012-11-22abs ↗pdf ↗

(1) For a compact Riemannian manifold without boundary (M,g)(M,g) containing n+1n+1 points pip_i and the nn-dimensional standard simplex ΔΔ, the miniser of \[ E: M \times Δ\to {\mathbf R}, (a,λ) \mapsto λ^0 d^2(a,p_0) + \dots + λ^n d^2(a,p_n) \] is considered as point with "barycentric coordinates" λiλ_i within the so-ca…

2015-05-14abs ↗pdf ↗

Convex sparsity-promoting regularizations are ubiquitous in modern statistical learning. By construction, they yield solutions with few non-zero coefficients, which correspond to saturated constraints in the dual optimization formulation. Working set (WS) strategies are generic optimization techniques that consist in s…

2017-03-21abs ↗pdf ↗

Study on symmetric automorphisms of RAAGs, proving finiteness properties and contractibility.

problem Finiteness properties and contractibility of symmetric automorphisms of RAAGs.
method Definition of symmetric automorphism group, construction of symmetric Outer space, proof of contractibility.
result Finiteness properties and contractibility results for symmetric automorphisms of RAAGs.

New insights into optimizing Local SGD's outer optimizer for faster convergence.

problem Understanding the impact of outer optimizer and its hyperparameters in Local SGD.
method Analyzing convergence guarantees with new outer learning rates and momentum.
result Tuning the outer learning rate can improve convergence and handle inner learning rate ill-tuning.

We define the notion of a loop Hodge structure -- an infinite dimensional generalization of a Hodge structure -- and prove that a suitable variation of this object over a complex manifold is equivalent to the datum of a harmonic bundle. Hence one can study harmonic bundles using classical tools of Hodge theory, especia…

2015-11-19abs ↗pdf ↗

This work analyzes how often to update the target network in Q-learning.

problem Understanding the optimal frequency of target network updates in Q-learning.
method Formulated target updates as a nested optimization scheme, derived finite-time convergence analysis.
result Optimal target update frequency increases geometrically over time.