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

59118177236 · Jun 202019922001200920172026
48 results for selection criteria

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.

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.

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.

Model selection based on classical information criteria, such as BIC, is generally computationally demanding, but its properties are well studied. On the other hand, model selection based on parameter shrinkage by 1\ell_1-type penalties is computationally efficient. In this paper we make an attempt to combine their st…

2013-07-08abs ↗pdf ↗

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.

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.

Online feature selection has been an active research area in recent years. We propose a novel diverse online feature selection method based on Determinantal Point Processes (DPP). Our model aims to provide diverse features which can be composed in either a supervised or unsupervised framework. The framework aims to pro…

2018-06-12abs ↗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.

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.

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 ↗

Feature selection aims to select the smallest feature subset that yields the minimum generalization error. In the rich literature in feature selection, information theory-based approaches seek a subset of features such that the mutual information between the selected features and the class labels is maximized. Despite …

2018-11-29abs ↗pdf ↗

Proposes a new stability measure for model fitting on similar feature data sets.

problem Model fitting on data sets with similar features is challenging.
method Tuning hyperparameters in a multi-criteria fashion with predictive accuracy and feature selection stability.
result Our approach achieves similar or better predictive performance than single-criteria and stability selection approaches.

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.

Investigates model selection challenges in heterogeneous treatment effect estimation.

problem Lack of validation metrics for choosing the best model in treatment effect estimation.
method Empirical investigation of different model selection criteria.
result Complex interplay between selection strategies, estimators, and data.

Many statistical models are given in the form of non-normalized densities with an intractable normalization constant. Since maximum likelihood estimation is computationally intensive for these models, several estimation methods have been developed which do not require explicit computation of the normalization constant,…

2019-05-15abs ↗pdf ↗

Framework selects real estate redevelopment uses by integrating value, risk, complexity, and irreversibility.

problem Persistent underperformance of real estate assets due to structural misalignment.
method Integrates real-options logic and multi-criteria decision analysis.
result Reduces over-complexification and misalignment in strategic use selection.

New criteria improve imputation model selection using MOO.

problem Selecting the best imputation model using prediction accuracy metrics.
method Introduced three modified MOO criteria based on rank transformation, energy distance, and likelihood principle.
result Demonstrated how MOO is related to missing-at-random assumption and derived statistical and computational learning theories.

In unsupervised classification, Hidden Markov Models (HMM) are used to account for a neighborhood structure between observations. The emission distributions are often supposed to belong to some parametric family. In this paper, a semiparametric modeling where the emission distributions are a mixture of parametric distr…

2012-06-22abs ↗pdf ↗

New metrics using Laplace approximation improve Gaussian process model selection.

problem Finding a balance between model accuracy, interpretability, and simplicity.
method Introducing multiple metrics based on the Laplace approximation to evaluate Gaussian process models.
result Our metrics provide comparable performance to dynamic nested sampling but are significantly faster.

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 ↗

LMs perform poorly in true few-shot learning without held-out examples.

problem Evaluating few-shot performance of language models without access to held-out examples.
method Evaluated two model selection criteria (cross-validation and minimum description length) for choosing LM prompts and hyperparameters in true few-shot learning.
result Selection criteria often prefer models that perform worse than random selection, suggesting overestimation of few-shot ability.

We empirically test predictability on asset price by using stock selection rules based on maximum drawdown and its consecutive recovery. In various equity markets, monthly momentum- and weekly contrarian-style portfolios constructed from these alternative selection criteria are superior not only in forecasting directio…

2014-03-31abs ↗pdf ↗

Paper tackles ESG rating disagreement in sustainable investing portfolios.

problem Lack of alignment between ESG ratings from different agencies affects investment decisions.
method Proposes a nonlinear optimization model reformulated as a convex quadratic program to address ESG rating disagreement.
result The proposed model can effectively manage ESG rating disagreement and improve investment decisions.

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.

MOSAIC selects few informative exemplars from high-dimensional data with non-linear structures.

problem Representative selection from high-dimensional data with non-linear structures.
method MOSAIC uses a multi-criteria approach with a quadratic formulation to maximize global representation power, diversity, and outlier detection.
result MOSAIC maximizes data coverage in a transformed space and achieves robustness to various outlier types.

Enhances credit card limit adjustments by considering treatment uncertainty and prediction criteria.

problem Optimal treatment selection under multitreatment scenarios.
method Proposes a comprehensive methodology incorporating conditional value-at-risk and prediction criterion for continuous outcomes.
result Significantly improved policy performance in credit card limit adjustments.

New approach to adaptively select bandwidths in nonparametric regression.

problem Adaptive bandwidth selection in nonparametric regression.
method Inspired by 2\ell_2-norms of interval projections, introduces a new bandwidth selection procedure.
result Obtains non-asymptotic risk bounds for local polynomial regression methods that adapt to local Hölder exponent.

New model handles complex non-linear relationships with hidden graph structures.

problem Modeling non-linear relationships with hidden graph-structured interactions.
method Block-diagonal localized mixture of polynomial experts (BLoMPE) regression model with penalized maximum likelihood selection criterion.
result Strong theoretical guarantee for finite-sample oracle inequality.

The paper examines domain generalization algorithms and finds empirical risk minimization performs well.

problem Comparing domain generalization algorithms is difficult due to inconsistent experimental conditions.
method Implemented DomainBed, a testbed for domain generalization with seven datasets and model selection criteria.
result Empirical risk minimization shows state-of-the-art performance across all datasets.

The paper proposes a method to select clusters, models, and algorithms based on quadratic discriminant scores.

problem Selecting the number of clusters, models, and algorithms in cluster analysis.
method Develops quadratic scores for cluster quality, uses bootstrap resampling, and compares partitions.
result The proposed method achieves better overall performance compared to other state-of-the-art methods.

In this work we present a review of the state of the art of information theoretic feature selection methods. The concepts of feature relevance, redundance and complementarity (synergy) are clearly defined, as well as Markov blanket. The problem of optimal feature selection is defined. A unifying theoretical framework i…

2015-09-24abs ↗pdf ↗

BayesBoost combines boosting and Bayesian methods for linear mixed models, improving uncertainty estimation and variable selection.

problem Lack of straightforward uncertainty estimation for parameters in high-dimensional linear mixed models.
method BayesBoost: Combines boosting and Bayesian inference for linear mixed models.
result Improves uncertainty estimation and variable selection in linear mixed models.