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

Trend · papers per month

18375573 · May 202619922001200920172026
48 results for Termination criterion

A new BO termination criterion for HPO reduces optimization time without sacrificing test performance.

problem Determining an optimal budget for hyperparameter optimization.
method A new termination criterion based on the discrepancy between predictive and computable target performance.
result The proposed termination criterion achieves a better trade-off between test performance and optimization time.

The paper analyzes and proposes a new stopping criterion for recursive Bayesian classification.

problem Limitations of conventional stopping criteria in recursive Bayesian classification.
method Geometric interpretation of state posterior progression and analysis of conventional criteria.
result Proposes a new stopping criterion to overcome limitations of conventional methods.

New test for SGD in binary classification reduces computation time.

problem Determining optimal stopping for SGD in binary classification.
method Proposes a new, simple, computationally inexpensive termination criterion for SGD.
result Termination criterion reduces expected misclassification probability.

New optimization method for portfolio management maximizing wealth and utility with risk control.

problem Maximizing terminal wealth and utility with mean-variance risk control.
method Transformed into a single-objective problem using overall happiness, solved in game theoretic framework.
result Closed-form solutions for specific utility functions reveal new optimal investment strategies.

Study optimal portfolio choice with risk control for log-returns.

problem Optimal portfolio choice with risk management in continuous-time markets.
method Characterized optimal terminal wealth using concave envelope, derived analytical expressions for optimal wealth and policy, found efficient frontier.
result Efficient frontier is concave curve connecting minimum-risk to growth-optimal portfolios, not a vertical line.

This paper introduces a more efficient method for estimating level sets with a stopping criterion.

problem Efficiently estimating regions where a function exceeds a threshold without exhaustive evaluations.
method Acquisition strategy with a stopping criterion for εε-accurate level set estimation.
result The method satisfies εε-accuracy with a confidence level of 1δ1 - δ and guarantees on lower bounds of performance metrics.

FDR criterion simplifies complex causal graphs to a standard front-door setting.

problem Complex causal graphs make identification of causal effects difficult and computationally infeasible.
method Front-door reducibility (FDR) criterion and FDR-TID algorithm.
result Many graphs can be simplified to a standard front-door setting, making causal effect identification simpler and more interpretable.

Optimizes portfolio growth rate for a behavioral investor considering terminal relative growth rate.

problem Optimizing a behavioral investor's portfolio growth rate under relative growth criterion.
method Martingale method, concavification, and quantile optimization techniques.
result Derives closed-form optimal growth rate and finds significant impact of benchmark growth rate.

Adaptive denoising models adjust the number of steps based on noise level.

problem Generating data with lower intrinsic dimensions.
method Adaptive diffusion models using Doob's h-transform to terminate at a random time.
result Adaptive models simplify termination to a first-hitting rule, enhancing adaptability.

New methods for convex optimization with locally Lipschitz gradient, achieving faster convergence.

problem Optimization problems with locally Lipschitz continuous gradient.
method Accelerated proximal gradient (APG) methods and proximal augmented Lagrangian method.
result Achieved faster convergence rates for convex optimization problems with locally Lipschitz gradient.

In this study the Voronoi interpolation is used to interpolate a set of points drawn from a topological space with higher homology groups on its filtration. The technique is based on Voronoi tessellation, which induces a natural dual map to the Delaunay triangulation. Advantage is taken from this fact calculating the p…

2019-11-08abs ↗pdf ↗

To improve the efficient frontier of the classical mean-variance model in continuous time, we propose a varying terminal time mean-variance model with a constraint on the mean value of the portfolio asset, which moves with the varying terminal time. Using the embedding technique from stochastic optimal control in conti…

2019-09-28abs ↗pdf ↗

A new method designs batches for Bayesian optimization more efficiently.

problem Efficiently designing batches for Bayesian optimization to reduce total time.
method Minimal Terminal Variance (MTV) acquisition function, optimizing I-optimality criterion.
result MTV designs batches more efficiently than other methods, as shown by numerical experiments.

This paper investigates Shampoo's heuristics and decouples preconditioner updates.

problem Improving Shampoo's heuristics for training neural networks.
method Decomposing preconditioner updates, correcting eigenvalues, and adapting eigenbasis computation frequency.
result Principled techniques to remove Shampoo's heuristics and improve training algorithms.

In this work, we consider the problem of autonomously discovering behavioral abstractions, or options, for reinforcement learning agents. We propose an algorithm that focuses on the termination condition, as opposed to -- as is common -- the policy. The termination condition is usually trained to optimize a control obj…

2019-02-26abs ↗pdf ↗

Study bounds for prices of European and American options with optional termination.

problem Bounding prices of options with potential termination.
method Duality results linking upper prices of vulnerable options to American options with constrained exercise times.
result Linking upper prices of vulnerable options to American options and game options.

The paper finds optimal threshold strategies for insurance companies with a positive terminal value at creeping ruin.

problem Optimizing dividend payments in an insurance company's surplus process with a positive terminal value at creeping ruin.
method Using fluctuation theory, the paper derives explicit formulas for the objective function and shows the optimality of threshold strategies.
result Threshold strategies are optimal for the dividend optimization problem under certain conditions.

We study the optimal excess-of-loss reinsurance problem when both the intensity of the claims arrival process and the claim size distribution are influenced by an exogenous stochastic factor. We assume that the insurer's surplus is governed by a marked point process with dual-predictable projection affected by an envir…

2019-04-10abs ↗pdf ↗

We define a discrete Laplace-Beltrami operator for simplicial surfaces. It depends only on the intrinsic geometry of the surface and its edge weights are positive. Our Laplace operator is similar to the well known finite-elements Laplacian (the so called ``cotan formula'') except that it is based on the intrinsic Delau…

2005-03-11abs ↗pdf ↗

The study proves a key inequality for specific types of three-dimensional spaces.

problem Establishing a mathematical inequality for a specific class of three-dimensional spaces.
method Developed the orbifold version of the Bogomolov-Gieseker inequality for stable Q-sheaves on log terminal Kähler threefolds.
result Proved the Bogomolov-Gieseker inequality for log terminal Kähler threefolds.

Employee stock options (ESOs) are American-style call options that can be terminated early due to employment shock. This paper studies an ESO valuation framework that accounts for job termination risk and jumps in the company stock price. Under general Lévy stock price dynamics, we show that a higher job termination ri…

2015-04-30abs ↗pdf ↗

A/B testing refers to the task of determining the best option among two alternatives that yield random outcomes. We provide distribution-dependent lower bounds for the performance of A/B testing that improve over the results currently available both in the fixed-confidence (or delta-PAC) and fixed-budget settings. When…

2014-05-13abs ↗pdf ↗

Investor optimizes portfolio under dynamic risk preferences.

problem Optimizing investment under uncertain future risk attitudes.
method Developed a general equilibrium framework and solved for subgame-perfect equilibrium policies.
result Equilibrium policies include a novel hedging component to counteract anticipated risk aversion changes.

Study optimal liquidation with multiple regimes using BSDEs with singular terminal values.

problem Optimal liquidation with regime switching in dark pools.
method Introduced a system of BSDEs with jumps and singular terminal values.
result Existence and uniqueness results for the BSDE system are obtained.

Develops a learning model predictive controller for competitive racing.

problem Lack of exploration in state space and complexity in obstacle avoidance.
method Explores state space through multiple initializations and develops a new method for convex terminal set selection.
result Yields a richer terminal safe set and maintains convexity.

Circular nets with spherical parameter lines have geometric properties related to Darboux cyclides and terminating Laplace sequences.

problem Discretizing surfaces with spherical curvature lines.
method Lie-geometric discretisation in terms of principal contact element nets.
result Circular nets with two families of spherical parameter lines are related to Darboux cyclides.

We apply the language of the groupoid approach to Lie pseudo-groups, and the classical Cartan-Kuranishi theorem, to prove that Cartan's equivalence method terminates at involution (or at complete reduction) for constant type problems.

2018-10-24abs ↗pdf ↗

In this paper, the `Approximate Message Passing' (AMP) algorithm, initially developed for compressed sensing of signals under i.i.d. Gaussian measurement matrices, has been extended to a multi-terminal setting (MAMP algorithm). It has been shown that similar to its single terminal counterpart, the behavior of MAMP algo…

2014-01-11abs ↗pdf ↗

Researchers find Kähler-Einstein metrics near isolated log terminal singularities.

problem Existence of Kähler-Einstein metrics with positive curvature near isolated log terminal singularities.
method Solving complex Monge-Ampère equations to analyze the existence of metrics.
result Existence of smooth solutions in subcritical regimes, with critical exponent expressed in terms of normalized volume.