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

Trend · papers per month

2555107641,019 · Jun 202019922001200920172026
48 results for Relative Performance 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.

The study examines Nash equilibria in utility maximization games with multiplicative performance criteria.

problem Existence and uniqueness of Nash equilibria in multiplicative performance criteria games.
method General characterization of Nash equilibria for a large class of utility functions.
result Existence and uniqueness of Nash equilibria for arbitrary initial wealth vectors.

We provide a simple, combinatorial criteria for a hierarchically hyperbolic space to be relatively hyperbolic by proving a new formulation of relative hyperbolicity in terms of hierarchy structures. In the case of clean hierarchically hyperbolic groups, this criteria characterizes relative hyperbolicity. We apply our c…

2019-05-29abs ↗pdf ↗

Study time-inconsistent portfolio optimization for competitive agents with relative performance criteria.

problem Time-inconsistent mean field and n-agent games under relative performance criteria.
method Construct open-loop equilibrium strategies for n-agent games and mean field games.
result Explicit solutions for n-agent games and mean field games, unique in a special class of equilibria.

Study optimal portfolios for many players in a market model with random coefficients.

problem Optimal portfolio selection for many players under relative performance criteria in a market model with random coefficients.
method Game theory and stochastic optimal control, focusing on CARA and CRRA risk preferences, and extending to continuum of players.
result Existence of forward Nash equilibrium and mean field equilibrium for the n-agent game and corresponding mean field stochastic optimal control problem.

New pruning methods improve dynamic sparse training performance.

problem Improving dynamic sparse training performance.
method Design and empirical analysis of pruning criteria.
result Most pruning methods yield similar results, but magnitude-based pruning performs best in low-density regimes.

The Exploration-Exploitation tradeoff arises in Reinforcement Learning when one cannot tell if a policy is optimal. Then, there is a constant need to explore new actions instead of exploiting past experience. In practice, it is common to resolve the tradeoff by using a fixed exploration mechanism, such as εε-greedy ex…

2018-12-13abs ↗pdf ↗

The paper analyzes how investors' wealth can decline collectively under partial information.

problem Investors' wealth can decline collectively under partial information.
method The paper derives a Nash equilibrium for mean-variance portfolio selection under relative performance criteria, considering both full and partial information.
result Relative performance criteria can lead to downward self-reinforcement of investors' wealth, which is more pronounced under partial information.

Unified perspective unites Bayesian optimization and active learning for efficient goal-oriented optimization.

problem Efficiently optimize expensive engineering and scientific problems with limited data.
method Unified framework linking Bayesian infill criteria and active learning criteria.
result Unified approach formalizes Bayesian infill criteria and active learning criteria.

This paper considers the problem of choosing a good classifier. For each problem there exist an optimal classifier, but none are optimal, regarding the error rate, in all cases. Because there exists a large number of classifiers, a user would rather prefer an all-purpose classifier that is easy to adjust, in the hope t…

2018-02-10abs ↗pdf ↗

We study two types of preconditioners and preconditioned stochastic gradient descent (SGD) methods in a unified framework. We call the first one the Newton type due to its close relationship to the Newton method, and the second one the Fisher type as its preconditioner is closely related to the inverse of Fisher inform…

2018-09-26abs ↗pdf ↗

The paper analyzes competition among fund managers using excess logarithmic returns and constructs games to find optimal allocations.

problem Optimal allocation strategies among fund managers considering excess logarithmic returns.
method Constructs both nn-player and mean field games to address the competition problem.
result The MFE of the MFG represents the limit of nn-player game's equilibrium as nn approaches infinity.

New method for dynamic valuation in markets with random endowments.

problem Dynamic valuation in markets with random endowments.
method Developed new FBSDE systems and established optimality conditions.
result Established necessary and sufficient conditions for optimality.

This paper optimizes stock portfolios considering ESG criteria using Bayesian optimization.

problem Optimizing financial investments while incorporating ESG criteria.
method Bayesian optimization to maximize stock portfolio performance under ESG constraints.
result A scalable approach to optimize stock portfolios that balance financial performance and ESG compliance.

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 ↗

FADE framework improves fairness and accuracy in ensemble learning.

problem Improving fairness in existing models without sacrificing accuracy.
method Flexible fair ensemble learning framework targeting multiple fairness criteria.
result Multiple unfairness measures can be minimized simultaneously with little impact on accuracy.

New statistical test for change-point detection using relative entropy.

problem Offline change-point detection using divergence metrics.
method Study of empirical relative entropy distributions, derivation of approximations, introduction of new Berry-Esseen bounds.
result Theoretical and practical validation of relative entropy for change-point detection.

Study Nash equilibrium in market with relative wealth concerns under partial information and heterogeneous priors.

problem Analyzing Nash equilibrium in a market with unobservable return rates and heterogeneous priors.
method Established a Nash equilibrium through a separation result and martingale argument. Used fully-coupled linear FBSDEs and deep neural networks for numerical computation.
result Investment strategies under relative wealth concerns exhibit a herd effect, with accurate prior estimators leading the market.

Characterizes geometric actions on graphs with flexible stabilizers.

problem Understanding geometric actions on flexible stabilizers.
method Defining generalized fine actions and proving relative quasi-convexity criteria.
result Characterizes Bowditch boundary points in relatively geometric actions.

Selective regression allows abstention to improve fairness criteria.

problem Selective regression can exacerbate disparities between subgroups.
method Proposes new fairness criteria and two approaches to mitigate performance disparity.
result Proposed fairness criteria ensures performance improvement for every subgroup with reduced coverage.

We find relative differential invariants of orders eight and nine for a planar nonparallelizable 3-web such that their vanishing is necessary and sufficient for a 3-web to be linearizable. This solves the Blaschke conjecture for 3-webs. As a side result, we show that the number of linearizations in the Gronwall conject…

2004-11-21abs ↗pdf ↗

The paper explores how the unit inclusion affects topological quantum field theories in non-semisimple categories.

problem Understanding the effects of unit inclusion in non-semisimple braided tensor categories on topological quantum field theories.
method Analyzes the dualizability of the unit inclusion morphism in Morita 4-category of braided tensor categories and applies the Cobordism Hypothesis.
result Shows that the unit inclusion in non-semisimple modular categories leads to non-compact relative 3D topological quantum field theories.

A very simple heuristic approach to the unfolding problem will be described. An iterative algorithm starts with an empty histogram and every iteration aims to add one entry to this histogram. The entry to be added is selected according to a criteria which includes a χ2χ^2 test and a regularization. After a relatively s…

2014-10-17abs ↗pdf ↗

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 ↗

This research tackles monitoring machine learning algorithms post-deployment, addressing performativity issues.

problem Monitoring machine learning algorithms after deployment, especially when they affect their own data-generating process.
method Uses causal inference techniques to navigate performativity and compares different monitoring criteria and data sources.
result Different monitoring systems have varying operating characteristics and implications for ML monitoring design.

Unified framework for risk-aware policy learning in contextual bandits.

problem Optimizing decision rules in high-stakes domains with adverse outcomes.
method Distributional framework for Lipschitz-continuous risk functionals, with novel empirical concentration inequalities.
result Data-dependent suboptimality bounds with an ildeO(1/n) ilde{\mathcal{O}}(1/\sqrt{n}) rate, matching risk-neutral offline policy optimization.

We give a generalized and self-contained account of Haglund-Paulin's wallspaces and Sageev's construction of the CAT(0) cube complex dual to a wallspace. We examine criteria on a wallspace leading to finiteness properties of its dual cube complex. Our discussion is aimed at readers wishing to apply these methods to pro…

2012-09-05abs ↗pdf ↗

Fairness in machine learning has predominantly been studied in static classification settings without concern for how decisions change the underlying population over time. Conventional wisdom suggests that fairness criteria promote the long-term well-being of those groups they aim to protect. We study how static fairne…

2018-03-12abs ↗pdf ↗