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

Trend · papers per month

5.0%10.0%15.0%20.0% · Aug 199419922001200920172026
48 results for configuration selection

The performance of modern machine learning methods highly depends on their hyperparameter configurations. One simple way of selecting a configuration is to use default settings, often proposed along with the publication and implementation of a new algorithm. Those default values are usually chosen in an ad-hoc manner t…

2018-11-23abs ↗pdf ↗

Configuration spaces for computer systems can be challenging for traditional and automatic tuning strategies. Injecting task-specific knowledge into the tuner for a task may allow for more efficient exploration of candidate configurations. We apply this idea to the task of index set selection to accelerate database wor…

2019-09-16abs ↗pdf ↗

KoPA approximates matrices using Kronecker products for better flexibility.

problem Matrix approximation and denoising with Kronecker product decomposition.
method Approximate a matrix as a sum of Kronecker products of smaller matrices using extended information criteria for configuration selection.
result KoPA selects the true configuration with high probability under suitable conditions.

We consider a problem of ranking and selection via simulation in the context of personalized decision making, where the best alternative is not universal but varies as a function of some observable covariates. The goal of ranking and selection with covariates (R&S-C) is to use simulation samples to obtain a selection p…

2017-10-07abs ↗pdf ↗

Optimizes machine learning models while controlling risks.

problem Finding a model configuration that balances multiple conflicting metrics.
method Combines Bayesian Optimization with rigorous risk-controlling procedures.
result Identifies and selects Pareto optimal configurations with guaranteed risk levels.

Real-Time Bidding is nowadays one of the most promising systems in the online advertising ecosystem. In the presented study, the performance of RTB campaigns is improved by optimising the parameters of the users' profiles and the publishers' websites. Most studies about optimising RTB campaigns are focused on the biddi…

2019-10-29abs ↗pdf ↗

The topology and the geometry of a surface play a fundamental role in determining the equilibrium configurations of thin films of liquid crystals. We propose here a theoretical analysis of a recently introduced surface Frank energy, in the case of two-dimensional nematic liquid crystals coating a toroidal particle. Our…

2014-01-23abs ↗pdf ↗

Optimizes glmnet configuration for better accuracy and efficiency.

problem Inappropriate glmnet configuration leads to inaccurate solutions and increased computation time.
method Data-driven framework using neural networks to predict accuracy and computation time from dataset characteristics and configuration.
result Automatic selection of optimal configuration maximizing accuracy under a time constraint.

Auto-CASH uses Deep Q-Network to automatically select machine learning algorithms.

problem Automatic selection of machine learning algorithms and hyperparameters.
method Pre-trained model based on meta-learning using Deep Q-Network.
result Auto-CASH achieves better performance with shorter time compared to classical and state-of-the-art methods.

Financial markets are complex environments that produce enormous amounts of noisy and non-stationary data. One fundamental problem is online portfolio selection, the goal of which is to exploit this data to sequentially select portfolios of assets to achieve positive investment outcomes while managing risks. Various al…

2019-08-22abs ↗pdf ↗

Decoding strategies often exclude human-like tokens, creating a detectable gap in generated text.

problem Decoding strategies exclude contextually appropriate but statistically rare tokens, creating a detectable gap in generated text.
method Analysis of 1.8 million texts across 8 language models, 5 decoding strategies, and 53 hyperparameter configurations.
result 8-18% of human-selected tokens fall outside typical truncation boundaries, indicating a detectable gap.

Framework evaluates AI proposals for drug discovery, finds no LLM advantage.

problem No principled framework exists for evaluating AI-guided scientific selection under budget constraints.
method Formally verified metric (BSDS/DQS) penalizes false discoveries and excessive abstention.
result LLMs provide no marginal value over existing classifiers in drug discovery.

Enhances RSCNs with hybrid regularization for nonlinear dynamics.

problem Modeling nonlinear dynamic systems with uncertainties.
method Recurrent stochastic configuration networks with hybrid regularization.
result The method outperforms other models in nonlinear system identification and industrial tasks.

Algorithm reduces audit costs by identifying best service configurations from biased textual evidence.

problem Designing service systems from textual evidence requires accurate selection despite biased automated scoring.
method Developed PP-LUCB algorithm combining LLM scores and selective audits to minimize costs.
result Correctly identified the best model in 40/40 trials with 90% cost reduction.

Many deep models have been recently proposed for anomaly detection. This paper presents comparison of selected generative deep models and classical anomaly detection methods on an extensive number of non--image benchmark datasets. We provide statistical comparison of the selected models, in many configurations, archite…

2018-07-13abs ↗pdf ↗

Machine learning predicts Bitcoin returns but trading performance drops with costs.

problem Trading Bitcoin predictions with transaction costs.
method XGBoost, LSTM, iTransformer models evaluated in walk-forward protocol; cost-aware execution filter implemented.
result Cost-aware execution filter restores profitability; XGBoost strategy outperforms.

Auto-Surprise automates recommender system selection and optimization.

problem Finding the best algorithm and hyperparameters for recommender systems.
method Extends Surprise library with TPE optimization for algorithm selection and hyperparameter tuning.
result Significantly faster in finding optimal hyperparameters compared to grid search.

Role mining tackles the problem of finding a role-based access control (RBAC) configuration, given an access-control matrix assigning users to access permissions as input. Most role mining approaches work by constructing a large set of candidate roles and use a greedy selection strategy to iteratively pick a small subs…

2012-12-19abs ↗pdf ↗

Federated LIDAR aided beam selection reduces mmWave beam search overhead.

problem Efficient link configuration in mmWave communication systems with reduced beam search overhead.
method Federated learning of LIDAR data to train a shared neural network for beam selection.
result Proposed method significantly outperforms previous works in performance and complexity.

Paper proposes a statistical test for feature selection pipelines using selective inference.

problem Assessing the significance of feature selection pipelines in data analysis.
method Selective inference technique applied to feature selection pipelines composed of various algorithms.
result The proposed statistical test controls false positive feature selection probabilities.

Machine learning (ML) methods have been developing rapidly, but configuring and selecting proper methods to achieve a desired performance is increasingly difficult and tedious. To address this challenge, automated machine learning (AutoML) has emerged, which aims to generate satisfactory ML configurations for given tas…

2018-10-31abs ↗pdf ↗

Recurrent neural networks are a powerful tool, but they are very sensitive to their hyper-parameter configuration. Moreover, training properly a recurrent neural network is a tough task, therefore selecting an appropriate configuration is critical. Varied strategies have been proposed to tackle this issue. However, mos…

2018-05-18abs ↗pdf ↗

Autodock is a widely used molecular modeling tool which predicts how small molecules bind to a receptor of known 3D structure. The current version of AutoDock uses meta-heuristic algorithms in combination with local search methods for doing the conformation search. Appropriate settings of hyperparameters in these algor…

2018-12-02abs ↗pdf ↗

Adaptive speculative decoding framework for LLMs using bandit algorithms.

problem Adaptive speculative decoding for LLMs to balance speed and quality.
method Formulated as a Multi-Armed Bandit problem, proposed UCBSpec and EXP3Spec algorithms.
result UCBSpec algorithm achieves optimal regret performance up to universal constants.

New framework uses MABs for better WLAN performance.

problem Maximizing enterprise WLAN performance with complex AP and station interactions.
method Empowered APs and stations with agents using Thompson sampling to learn optimal channel and AP selection.
result Adaptive framework using MABs outperforms static configurations in various scenarios.

Paper compiles ML algorithm performance benchmarks on OpenML datasets.

problem Finding optimal hyperparameters for ML algorithms efficiently.
method Generated benchmark data for 7 ML algorithms on 39 datasets, fixed hyperparameters before testing.
result Comprehensive dataset of ML algorithm performance sensitivity.

Hyperparameter optimization aims to find the optimal hyperparameter configuration of a machine learning model, which provides the best performance on a validation dataset. Manual search usually leads to get stuck in a local hyperparameter configuration, and heavily depends on human intuition and experience. A simple al…

2017-10-17abs ↗pdf ↗

Deep Bayesian neural networks effectively select variables with rigorous uncertainty quantification.

problem High-dimensional variable selection with uncertainty.
method Developed new Bayesian non-parametric theorems for deep BNNs.
result BNNs can learn variable importance effectively in high dimensions and rigorously quantify uncertainty.

Wireless communication systems operate in complex time-varying environments. Therefore, selecting the optimal configuration parameters in these systems is a challenging problem. For wireless links, \emph{rate selection} is used to select the optimal data transmission rate that maximizes the link throughput subject to a…

2019-02-28abs ↗pdf ↗

AutoQuant addresses cryptocurrency backtesting fragility by modeling execution costs and improving strategy selection.

problem Fragile backtests of cryptocurrency perpetual futures ignoring microstructure frictions and execution costs.
method Execution-centric framework with Bayesian optimization, double screening, and strict T+1 semantics.
result Fee-only and zero-cost backtests overestimate returns, highlighting the importance of modeling execution costs.

Many real-world systems can be studied in terms of pattern recognition tasks, so that proper use (and understanding) of machine learning methods in practical applications becomes essential. While a myriad of classification methods have been proposed, there is no consensus on which methods are more suitable for a given …

2016-12-26abs ↗pdf ↗

Quality assessments of models in unsupervised learning and clustering verification in particular have been a long-standing problem in the machine learning research. The lack of robust and universally applicable cluster validity scores often makes the algorithm selection and hyperparameter evaluation a tough guess. In t…

2018-03-29abs ↗pdf ↗

Generative AI improves stock selection by synthesizing features from diverse data sources.

problem Automating feature discovery in stock market data.
method Used large language models with retrieval-augmented generation and structured prompting to synthesize features from various data sources.
result AI-generated features consistently outperform baselines, with Sharpe improvements ranging from 14% to 91%.

New algorithm optimizes complex model selection for non-homogeneous hidden Markov models.

problem Complex combinatorial optimization problem for model selection in NHHMMs.
method Adaptive simulated annealing EM algorithm (ASA-EM).
result Joint optimization of models and parameters for a criterion of interest.