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

Trend · papers per month

243487730973 · Jun 202019922001200920172026
48 results for 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.

Introduces new performance criteria for investment under distorted probabilities.

problem Reconciling time-consistent performance with probability distortions.
method Two definitions of forward rank-dependent criteria, equivalence established; characterization of viable probability distortion processes.
result Characterization of optimal wealth process and new distorted measure.

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.

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.

Improved recommendations using latent embeddings from user reviews.

problem Lack of consideration for latent embeddings in multi-criteria recommender systems.
method Utilized variational autoencoders to map user reviews into latent embeddings, which are then compressed into discrete vectors for multi-criteria recommendation.
result The proposed method significantly outperforms baselines across various datasets and evaluation measures.

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.

SPX optimizes multiple graph drawing metrics for better readability.

problem Graph drawing algorithms often optimize one metric at a time, leading to suboptimal layouts.
method Introduces Stress-Plus-X (SPX) framework that optimizes stress, crossings, angles, and upwardness simultaneously.
result SPX achieves results close to state-of-the-art algorithms that optimize metrics individually.

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 ↗

This work compares lattice-free and lattice-based training criteria for LVCSR.

problem Improving acoustic model performance in speech recognition.
method Direct comparison of lattice-free and lattice-based sequence discriminative training criteria using GPU.
result Lattice-free MMI performance is comparable to lattice-based criteria, while lattice-based sMBR remains superior.

In a Markovian stochastic volatility model, we consider financial agents whose investment criteria are modelled by forward exponential performance processes. The problem of contingent claim indifference valuation is first addressed and a number of properties are proved and discussed. Special attention is given to the c…

2011-09-18abs ↗pdf ↗

Proposes a multi-criteria AutoML system to optimize additional criteria like fairness and interpretability.

problem Current AutoML systems limit model choices and preprocessing steps, ignoring secondary criteria.
method Optimizes additional criteria directly to guide the search for optimal machine learning pipelines.
result Demonstrates the need and usefulness of a multi-criteria AutoML system.

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 fairness criteria for algorithmic recourse actions that consider causal relationships.

problem Fairness of recourse actions in algorithmic classification.
method Proposes two new fairness criteria at group and individual levels, explicitly accounting for causal relationships.
result Fairness of recourse is complementary to fairness of prediction, and can be enforced by altering the classifier.

In this paper we consider the problem of Gaussian process classifier (GPC) model selection with different Leave-One-Out (LOO) Cross Validation (CV) based optimization criteria and provide a practical algorithm using LOO predictive distributions with such criteria to select hyperparameters. Apart from the standard avera…

2012-06-26abs ↗pdf ↗

The construction of efficient and effective decision trees remains a key topic in machine learning because of their simplicity and flexibility. A lot of heuristic algorithms have been proposed to construct near-optimal decision trees. ID3, C4.5 and CART are classical decision tree algorithms and the split criteria they…

2015-11-25abs ↗pdf ↗

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.

The paper introduces a new model selection criterion for various time series models.

problem Designing adaptive model selection criteria for a wide range of time series models.
method The approach involves a penalized contrast akin to Hannan and Quinn's criterion, with a data-driven calibrated term.
result The new criteria select the true model almost surely asymptotically for a wide range of time series models.

The Wisdom of Crowds is a phenomenon described in social science that suggests four criteria applicable to groups of people. It is claimed that, if these criteria are satisfied, then the aggregate decisions made by a group will often be better than those of its individual members. Inspired by this concept, we present a…

2016-05-13abs ↗pdf ↗

High-dimensional predictive models, those with more measurements than observations, require regularization to be well defined, perform well empirically, and possess theoretical guarantees. The amount of regularization, often determined by tuning parameters, is integral to achieving good performance. One can choose the …

2016-02-04abs ↗pdf ↗

TOPNet integrates task-based evaluation into machine learning models.

problem Non-differentiable task-based evaluation criteria in real-world applications.
method Task-Oriented Prediction Network (TOPNet) with learnable surrogate loss function.
result TOPNet significantly outperforms traditional and heuristic models in financial prediction tasks.

New method for sorting with interacting criteria using value functions and convex programming.

problem Learning models for sorting with interacting criteria.
method Additive piecewise-linear value function, convex quadratic programming, regularization, classification methods.
result The proposed method outperforms classical methods in sorting tasks.

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.

This paper compares two clustering evaluation metrics, revealing their differences and properties.

problem Understanding the differences between misclassification error distance and adjusted Rand index.
method Population origins, data analysis examples, detailed case studies, and simulation study.
result Reveals previous misconceptions about the two metrics and their distributions.

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.

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.

When performing regression or classification, we are interested in the conditional probability distribution for an outcome or class variable Y given a set of explanatoryor input variables X. We consider Bayesian models for this task. In particular, we examine a special class of models, which we call Bayesian regression…

2013-02-06abs ↗pdf ↗

Develops fair clinical risk prediction models using counterfactual reasoning.

problem Addressing biases in clinical risk prediction models for underrepresented groups.
method Augmented counterfactual fairness criteria applied to electronic health records data.
result Demonstrates the feasibility of fair clinical risk prediction models using counterfactual inference.

Automated model assesses online health info quality using machine learning.

problem Low quality health information on the internet poses risks to patients.
method Used machine learning models, specifically hierarchical encoder attention-based neural networks (HEA) with BERT and BioBERT embeddings.
result HEA models outperform traditional models in evaluating health info quality.

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 ↗

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 algorithms improve experimental design efficiency and approximation quality.

problem Finding optimal subset of vectors for expensive measurements.
method Bayesian experimental design using determinantal point processes.
result Developed efficient algorithms for optimal design under multiple criteria.

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.