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

Trend · papers per month

3707411,1111,481 · Jun 202019922001200920172026
48 results for Automatic Model Tuning

This paper proposes automatic tuning of Bayesian Optimization's acquisition function.

problem Optimizing black-box functions with noisy, expensive evaluations and hyperparameter tuning.
method Exploring heuristics to automatically tune acquisition functions in Bayesian Optimization.
result Demonstrates effectiveness of heuristics in automatic Bayesian Optimization.

New method improves hyperparameter tuning efficiency across similar tasks.

problem Mismatch between evaluations in current and previous tasks.
method Nested drop-out and auto-relevance determination for learning basis functions of increasing complexity.
result Improves sample efficiency in hyperparameter tuning across different data regimes.

Proposes an automatic cyclical scheduling for gradient-based discrete sampling.

problem Gradient-based sampling in high-dimensional models can get stuck in local modes.
method Cyclical step size and balancing schedules with automatic hyperparameter tuning.
result Proves non-asymptotic convergence and inference guarantees for general discrete distributions.

Meta-SAC automatically tunes SAC's entropy temperature for better exploration.

problem Exploration-exploitation dilemma in reinforcement learning.
method Meta-SAC uses metagradient and a novel meta objective to automatically adjust SAC's entropy temperature.
result Meta-SAC outperforms SAC-v2 by 10% on the humanoid-v2 task.

MLtuner automatically tunes settings for training tunables (such as the learning rate, the momentum, the mini-batch size, and the data staleness bound) that have a significant impact on large-scale machine learning (ML) performance. Traditionally, these tunables are set manually, which is unsurprisingly error-prone and…

2018-03-20abs ↗pdf ↗

D-Adaptation automatically sets optimal learning rates without manual tuning.

problem Optimizing learning rates for efficient convergence in machine learning.
method D-Adaptation, which asymptotically achieves optimal learning rates without back-tracking or additional evaluations.
result D-Adaptation automatically matches hand-tuned learning rates across diverse problems.

Interactive applications incorporating high-data rate sensing and computer vision are becoming possible due to novel runtime systems and the use of parallel computation resources. To allow interactive use, such applications require careful tuning of multiple application parameters to meet required fidelity and latency …

2012-03-15abs ↗pdf ↗

BASS efficiently learns time-varying graphs with low complexity and automatic tuning.

problem Estimating time-varying graphical models with efficient and automatic parameter tuning.
method BASS uses temporally-dependent spike-and-slab priors and variational inference to learn graph structures efficiently.
result BASS outperforms existing methods in recovering true graphs, especially for high-dimensional cases.

Machine learning algorithms frequently require careful tuning of model hyperparameters, regularization terms, and optimization parameters. Unfortunately, this tuning is often a "black art" that requires expert experience, unwritten rules of thumb, or sometimes brute-force search. Much more appealing is the idea of deve…

2012-06-13abs ↗pdf ↗

New method improves sampling from complex, multi-peaked distributions.

problem Sampling from high-dimensional, multimodal distributions using HMC.
method Combines tempered HMC with automatic tuning strategies.
result Demonstrates more effective scaling with dimension than adaptive methods.

Tuning SVM and boosting models using optimization algorithms.

problem Tuning parameters for SVM and boosting models across various datasets.
method Used grid search to identify parameter ranges and optimization algorithms to select models.
result Optimization algorithms outperformed grid search in selecting well-performing models.

We study a budgeted hyper-parameter tuning problem, where we optimize the tuning result under a hard resource constraint. We propose to solve it as a sequential decision making problem, such that we can use the partial training progress of configurations to dynamically allocate the remaining budget. Our algorithm combi…

2019-02-01abs ↗pdf ↗

GOLS-I automatically determines learning rates for various neural network training algorithms.

problem Adapting learning rates in stochastic training algorithms for neural networks.
method Gradient-Only Line Search (GOLS-I) for automatically setting learning rates.
result GOLS-I learning rate schedules are competitive with manually tuned rates across multiple algorithms, architectures, datasets, and loss functions.

We introduce a technique that can automatically tune the parameters of a rule-based computer vision system comprised of thresholds, combinational logic, and time constants. This lets us retain the flexibility and perspicacity of a conventionally structured system while allowing us to perform approximate gradient descen…

2018-08-01abs ↗pdf ↗

A new Mapper algorithm optimizes data visualization through automatic parameter tuning.

problem Manual parameter tuning and fixed intervals limit the performance of the standard Mapper algorithm.
method Introduces a soft Mapper framework based on Gaussian mixture models for automatic interval construction and optimization via stochastic gradient descent.
result Demonstrates effectiveness in capturing underlying topological structures and identifying distinct subgroups.

New methods reduce private federated learning communication automatically.

problem Reducing communication in private federated learning.
method Automatic compression rate adjustment based on training error, using secure aggregation and differential privacy.
result Provable instance-optimal for mean estimation, achieving favorable compression rates.

During the development of AlphaGo, its many hyper-parameters were tuned with Bayesian optimization multiple times. This automatic tuning process resulted in substantial improvements in playing strength. For example, prior to the match with Lee Sedol, we tuned the latest AlphaGo agent and this improved its win-rate from…

2018-12-17abs ↗pdf ↗

New method for hyperparameter tuning in sparse matrix factorization.

problem Hyperparameter tuning in sparse matrix factorization.
method Numerical method based on evaluating the zero point of normalization factor in sparse matrix prior.
result Our method outperforms existing algorithms in ground-truth sparse matrix reconstruction.

A new method for automatic gradient tree boosting using information theory.

problem Automatic selection of tree complexity and number in gradient boosting.
method Optimism of greedy leaf splitting procedure modeled as a Cox-Ingersoll-Ross process, leading to an information criterion for model selection.
result The method achieves significant speedups (10-1400) compared to xgboost without sacrificing predictive power.

This paper fine-tunes BERT for stock market sentiment analysis and improves trading performance.

problem Improving trading performance in non-strongly efficient markets.
method Fine-tuning BERT on annotated data, combining with Alpha191 model for regression and prediction.
result Emotional factors significantly improve trading performance, increasing return rates by 73.8% compared to baseline.

This work improves texture segmentation by automatically tuning hyperparameters for Total-Variation.

problem The challenge is to automatically select hyperparameters for Total-Variation texture segmentation.
method The approach involves extending Stein's unbiased gradient estimator to handle correlated Gaussian noise, leading to an automatic tuning method.
result The method provides an automatic way to select hyperparameters for Total-Variation texture segmentation.

The random forest algorithm (RF) has several hyperparameters that have to be set by the user, e.g., the number of observations drawn randomly for each tree and whether they are drawn with or without replacement, the number of variables drawn randomly for each split, the splitting rule, the minimum number of samples tha…

2018-04-10abs ↗pdf ↗

Bayesian TNKMs automatically infer model complexity and feature relevance.

problem Manual tuning of TN rank and feature dimensions is error-prone and computationally expensive.
method Bayesian approach with hierarchical priors on TN factors for automatic rank and feature selection.
result Superior performance in prediction accuracy, uncertainty quantification, interpretability, and scalability.

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 ↗

Neural networks and deep learning are changing the way that artificial intelligence is being done. Efficiently choosing a suitable network architecture and fine-tune its hyper-parameters for a specific dataset is a time-consuming task given the staggering number of possible alternatives. In this paper, we address the p…

2019-05-15abs ↗pdf ↗

ControlVAE improves VAE performance by adding a controller to tune hyperparameters.

problem Existing VAE models struggle with KL vanishing and low reconstruction quality.
method ControlVAE combines a controller inspired by automatic control theory with VAE to improve performance.
result ControlVAE achieves better disentangling and reconstruction quality than existing methods.

In this work, we focus on fine-tuning an OpenAI GPT-2 pre-trained model for generating patent claims. GPT-2 has demonstrated impressive efficacy of pre-trained language models on various tasks, particularly coherent text generation. Patent claim language itself has rarely been explored in the past and poses a unique ch…

2019-07-01abs ↗pdf ↗

CL methods improve monolingual ASR models across new tasks without forgetting past data.

problem Catastrophic Forgetting in monolingual ASR models when adapting to new domains or accents.
method Implement and compare various Continual Learning methods for monolingual ASR.
result Best CL method reduces performance gap by over 40% with minimal past data.