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

3887761,1631,551 · Jun 202019922001200920172026
48 results for learning criteria

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.

Study tackles criterion collapse in learning criteria, showing conditions for loss minimization.

problem Criterion collapse in optimization, focusing on error probability minimizers.
method Analyzes various learning criteria, including DRO, OCE risks, and non-monotonic criteria.
result Non-monotonic criteria can avoid collapse, while monotonic ones cannot.

A method to select validation data from a dataset using statistical criteria.

problem Selecting a validation basis from a full dataset for machine learning model validation.
method Adopting a 'design of experiments' point of view and using statistical criteria, particularly Maximum Mean Discrepancy criteria.
result The 'support points' concept is particularly relevant for selecting validation data.

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.

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 ↗

Many machine learning frameworks, such as resource-allocating networks, kernel-based methods, Gaussian processes, and radial-basis-function networks, require a sparsification scheme in order to address the online learning paradigm. For this purpose, several online sparsification criteria have been proposed to restrict …

2014-09-21abs ↗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 ↗

Managing risk in dynamic decision problems is of cardinal importance in many fields such as finance and process control. The most common approach to defining risk is through various variance related criteria such as the Sharpe Ratio or the standard deviation adjusted reward. It is known that optimizing many of the vari…

2012-06-27abs ↗pdf ↗

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.

This work compares data reduction criteria for online Gaussian Processes.

problem The computational complexity of Gaussian Processes limits their applicability to small datasets and streaming scenarios.
method Unified comparison of several data reduction criteria, analyzing computational complexity and reduction behavior.
result Practical guidelines for choosing a suitable data reduction criterion for online Gaussian Processes.

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 ↗

AutoML systems are currently rising in popularity, as they can build powerful models without human oversight. They often combine techniques from many different sub-fields of machine learning in order to find a model or set of models that optimize a user-supplied criterion, such as predictive performance. The ultimate g…

2019-08-28abs ↗pdf ↗

We propose some machine-learning-based algorithms to solve hedging problems in incomplete markets. Sources of incompleteness cover illiquidity, untradable risk factors, discrete hedging dates and transaction costs. The proposed algorithms resulting strategies are compared to classical stochastic control techniques on s…

2019-02-14abs ↗pdf ↗

New criteria distinguish cause from effect in data, overcoming statistical limitations.

problem Determining causal direction from statistical dependence alone.
method Intuitive criteria based on simplicity of prediction, tested on synthetic data.
result Criteria accurately distinguish cause from effect in various scenarios.

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.

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 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.

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.

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 ↗

In this work we study loss functions for learning and evaluating probability distributions over large discrete domains. Unlike classification or regression where a wide variety of loss functions are used, in the distribution learning and density estimation literature, very few losses outside the dominant log losslog\ loss ar…

2019-06-06abs ↗pdf ↗

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 ↗

Two new criteria help understand the advantage of deep neural networks.

problem Understanding the advantage of deepening neural networks.
method Proposed two new criteria to evaluate the expressivity of functions computable by deep neural networks.
result Increasing layers is more effective than increasing units in improving the expressivity of deep neural networks.

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 ↗

This work tackles online memory selection in continual learning using information theory.

problem Online selection of a representative replay memory from data streams.
method Information-theoretic criteria (surprise, learnability) and Bayesian model for efficient computation.
result InfoRS improves robustness against data imbalance compared to reservoir sampling.

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.

New method prevents classifiers from relying on spurious correlations.

problem Group invariant learning fails to prevent classifiers from depending on spurious correlations.
method Statistical independence tests to construct groups and reweight samples by group label proportion.
result New method significantly outperforms existing group invariant learning methods in generalizing to spurious correlation shifts.

A new framework for measuring uncertainty in machine learning models.

problem Uncertainty measures for second-order distributions in machine learning models have theoretical flaws.
method Formal criteria and a general framework based on the Wasserstein distance.
result The Wasserstein distance-based measure satisfies all proposed criteria for meaningful uncertainty measures.

The paper proposes criteria and methods for evaluating and aggregating feature-based model explanations.

problem Lack of quantitative evaluation criteria for feature-based model explanations.
method Developed quantitative evaluation criteria (low sensitivity, high faithfulness, low complexity), devised a framework for aggregation, and derived a new aggregate Shapley value explanation function.
result A new aggregate Shapley value explanation function that minimizes sensitivity.

Much work has been done in understanding human creativity and defining measures to evaluate creativity. This is necessary mainly for the reason of having an objective and automatic way of quantifying creative artifacts. In this work, we propose a regression-based learning framework which takes into account quantitative…

2017-07-18abs ↗pdf ↗

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 ↗

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 use of machine learning systems to support decision making in healthcare raises questions as to what extent these systems may introduce or exacerbate disparities in care for historically underrepresented and mistreated groups, due to biases implicitly embedded in observational data in electronic health records. To …

2019-07-14abs ↗pdf ↗

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.