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

61123184245 · Jun 202019922001200920172026
48 results for numerical criteria

The paper characterizes when numerical criteria for PDE solvability fail and provides effective criteria for existence.

problem Characterizing when numerical criteria for PDE solvability fail.
method Finite number of subvarieties violating Nakai type criterion, and their rigidity.
result Finite number of subvarieties violating the Nakai type criterion, and these subvarieties are rigid.

Assume (1) asset returns follow a stochastic multi-factor process with time-varying conditional expectations; (2) investments are linear functions of factors. This paper calculates asymptotic joint moments of the logarithm of investor's wealth and the factors. These formulas enable fast computation of a wide range of i…

2003-04-11abs ↗pdf ↗

We provide notions of numerical effectiveness and numerical flatness for Higgs vector bundles on compact Kähler manifolds in terms of fibre metrics. We prove several properties of bundles satisfying such conditions and in particular we show that numerically flat Higgs bundles have vanishing Chern classes, and that they…

2006-05-25abs ↗pdf ↗

The paper proves a numerical condition for solving complex Hessian quotient equations with Calabi symmetry.

problem Solvability of complex Hessian quotient equations with specific symmetry.
method Proving a numerical condition and proposing a conjecture on existence of kk-subharmonic representatives.
result Numerical condition ensures solvability of complex Hessian quotient equations.

The study evaluates different parameter selection methods for Gaussian process interpolation.

problem Choosing optimal parameters for Gaussian process interpolation.
method Empirical study using scoring rules and leave-one-out selection criteria.
result The choice of model family is often more important than the selection criterion.

Let (M,ω)(M,ω) be a Kähler manifold and let KK be a compact group that acts on MM in a Hamiltonian fashion. We study the action of KCK^\mathbb{C} on probability measures on MM. First of all we identify an abstract setting for the momentum mapping and give numerical criteria for stability, semi-stability and polystabili…

2015-12-13abs ↗pdf ↗

The paper optimizes designs for distinguishing between Gaussian process models.

problem Discriminating between two Gaussian process models.
method Sequential and static design criteria, including Kullback Leibler divergences and log-likelihood ratios.
result Necessary conditions for optimal design measures are provided.

A new criterion selects models in overparameterized settings.

problem Model selection for overparameterized models with more parameters than data.
method Establishes Bayesian duality and introduces the Interpolating Information Criterion.
result The Interpolating Information Criterion selects models in overparameterized settings.

New method speeds up model selection for complex scientific tasks.

problem Exhaustive model selection is computationally infeasible for large model spaces.
method Branch-and-bound algorithm with non-monotonic criteria.
result Guaranteed identification of optimal models with significant computational speedups.

We present a new implementation of anisotropic mean curvature flow for contour recognition. Our procedure couples the mean curvature flow of planar closed smooth curves, with an external field from a potential of point-wise charges. This coupling constrains the motion when the curve matches a picture placed as backgrou…

2018-03-10abs ↗pdf ↗

The literature on optimal reinsurance does not deal with how much the effectiveness of such solutions is degraded by errors in parameters and models. The issue is investigated through both asymptotics and numerical studies. It is shown that the rate of degradation is often O(1/n)O(1/n) as the sample size nn of historical …

2019-12-09abs ↗pdf ↗

The paper addresses ill-conditioning in large spatial data, proposing solutions for prediction and likelihood estimation.

problem Ill-conditioning of the kernel matrix in large spatial data sets.
method Introduction of various optimality criteria and solutions for managing large spatial data.
result Solutions for managing large spatial data, addressing ill-conditioning and improving prediction and likelihood estimation.

Study evaluates various regularization methods for electricity price forecasting.

problem Improving accuracy of electricity price predictions.
method Applied ten different penalty functions to two model structures in two electricity markets.
result LQ and elastic net consistently produce more accurate forecasts than other regularization types.

The paper proves concentration inequalities for two-sample rank processes and applies them to ranking performance criteria.

problem Measuring the performance of ranking statistics between two populations.
method Proves concentration inequalities for two-sample rank processes indexed by VC classes of scoring functions.
result Generalization capacity of empirical maximizers of ranking performance criteria is investigated.

Most conventional Reinforcement Learning (RL) algorithms aim to optimize decision-making rules in terms of the expected returns. However, especially for risk management purposes, other risk-sensitive criteria such as the value-at-risk or the expected shortfall are sometimes preferred in real applications. Here, we desc…

2012-03-15abs ↗pdf ↗

Using computer calculations and working with representatives of pretzel tangles we established general adequacy criteria for different classes of knots and links. Based on adequate graphs obtained from all Kauffman states of an alternating link we defined a new numerical invariant: adequacy number, and computed adequac…

2008-11-01abs ↗pdf ↗

The paper develops stability criteria for real reductive Lie groups acting on manifolds.

problem Analyzing stability of real reductive Lie group actions on manifolds.
method Introduced a gradient map and maximal weight function to characterize stability conditions.
result Characterized stability, semistability, and polystability using numerical criteria.

We give some general criteria of being a homeomorphism for continuous mappings of topological manifolds, as well as criteria of being a diffeomorphism for smooth mappings of smooth manifolds. As an illustration, we apply these criteria to the problems arising in two- and three-dimensional grid generation.

2015-04-05abs ↗pdf ↗

vsOED optimizes experiment design with reinforcement learning for Bayesian models.

problem Optimizing the sequence of experiments in Bayesian models for efficient data collection.
method Reinforcement learning with variational posterior approximations to optimize design policy.
result vsOED achieves superior sample efficiency compared to existing methods.

The study reveals flaws in pruning criteria and proposes a new assumption for better filter selection.

problem Flaws in existing pruning criteria for CNNs.
method Empirical experiments and Convolutional Weight Distribution Assumption.
result The Convolutional Weight Distribution Assumption improves filter selection in pruning.

New criteria for Heegaard splittings ensure strong irreducibility and finite Goeritz groups.

problem Determining strong irreducibility and finite Goeritz groups of Heegaard splittings.
method Two diagrammatic criteria for Heegaard splittings, accepting arbitrary disk systems.
result Criteria ensure strong irreducibility and finite Goeritz groups for Heegaard splittings.

Multi-criteria recommender systems have been increasingly valuable for helping consumers identify the most relevant items based on different dimensions of user experiences. However, previously proposed multi-criteria models did not take into account latent embeddings generated from user reviews, which capture latent se…

2019-06-26abs ↗pdf ↗

Develops scenario theory for multi-criteria decision making.

problem Need for robustness assessment with multiple criteria and datasets.
method Collectively treats risks associated with individual criteria for multi-criteria decision problems.
result More accurate robustness certificates and sharper quantification of simultaneous criterion satisfaction.

We consider the problem of identifying patterns in a data set that exhibit anomalous behavior, often referred to as anomaly detection. In most anomaly detection algorithms, the dissimilarity between data samples is calculated by a single criterion, such as Euclidean distance. However, in many cases there may not exist …

2011-10-17abs ↗pdf ↗

The paper evaluates criteria for selecting cryptocurrencies based on historical data.

problem High risk of cryptocurrencies due to volatility.
method Characterized returns and risks using historical data in short time windows (7 and 15 days). Analyzed the importance of criteria using various methods.
result Importance of criteria for selecting cryptocurrencies is analyzed and evaluated.

We present criteria for establishing a triangulation of a manifold. Given a manifold M, a simplicial complex A, and a map H from the underlying space of A to M, our criteria are presented in local coordinate charts for M, and ensure that H is a homeomorphism. These criteria do not require a differentiable structure, or…

2018-03-20abs ↗pdf ↗

Robo-advisors use MPC to create dynamic investment strategies.

problem Static allocation methods limit robo-advisors' effectiveness.
method Combines MPC with Hidden Markov Model and Black-Litterman for dynamic asset allocation.
result MPC-based strategies outperform static approaches in dynamic and risk-budgeting criteria.

The paper analyzes performance criteria for competing fund managers in Ito-diffusion markets.

problem Analyzing performance of competing fund managers in Ito-diffusion markets.
method Developed forward relative performance criteria and forward Nash equilibrium for passive and competitive cases.
result Extended performance criteria for investment problems in Ito-diffusion markets.

A new method for multi-criteria recommender systems using graph attention networks.

problem Lack of nuanced relationships between users and items based on specific criteria.
method MDGAT, a multi-edge bipartite graph with dual attention networks and contrastive learning.
result MDGAT achieves higher accuracy in predicting item ratings compared to baseline methods.

New framework for resilient bi-criteria optimization under noisy feedback.

problem Bi-criteria combinatorial optimization with noisy function evaluations.
method Introducing (α,β,δ,extttN)(α,β,δ, exttt{N})-resilience and developing a black-box framework.
result Achieves sublinear regret and constraint violation for bi-criteria bandit problems.

A game-theoretic approach to multi-criteria ranking from ordinal data.

problem Ranking objects from ordinal data with multiple criteria.
method Generalizing von Neumann winner to multi-criteria setting using Blackwell's approachability.
result The Blackwell winner can be computed as a convex optimization problem and achieves near-optimal sample complexity.

Stress, edge crossings, and crossing angles play an important role in the quality and readability of graph drawings. Most standard graph drawing algorithms optimize one of these criteria which may lead to layouts that are deficient in other criteria. We introduce an optimization framework, Stress-Plus-X (SPX), that sim…

2019-08-04abs ↗pdf ↗

Recent work on fairness in machine learning has focused on various statistical discrimination criteria and how they trade off. Most of these criteria are observational: They depend only on the joint distribution of predictor, protected attribute, features, and outcome. While convenient to work with, observational crite…

2017-06-08abs ↗pdf ↗