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

2825648461,128 · Jun 202019922001200920172026
48 results for practical performance

BLAE solves batched linear bandits with optimal regret and practical performance.

problem Batched linear bandit problem with limited adaptivity.
method Integrates arm elimination with regularized G-optimal design, achieving minimax optimal regret.
result Achieves minimax optimal regret in both large-KK and small-KK regimes with O(loglogT)O(\log\log T) batches.

The study compares machine learning models for depression detection and highlights the importance of feature selection.

problem The choice of features in machine learning models for depression detection is crucial.
method Comparison of seven machine learning models on depression detection tasks.
result Optimal feature selection is essential for accurate and clinically acceptable classification solutions.

Practical algorithm for contextual bandits with large action spaces.

problem Efficient algorithms for decision making in large, continuous action spaces.
method Uses computational oracles for supervised learning and optimization over the action space.
result Achieves sample complexity, runtime, and memory independent of the size of the action space.

Bayesian methods promise to fix many shortcomings of deep learning, but they are impractical and rarely match the performance of standard methods, let alone improve them. In this paper, we demonstrate practical training of deep networks with natural-gradient variational inference. By applying techniques such as batch n…

2019-06-06abs ↗pdf ↗

Gluon optimizes LMO-based methods for large-scale tasks, improving performance and theory-practice gap.

problem LMO-based methods lack theoretical support for practical implementation and smoothness assumptions.
method Introduces Gluon, a new LMO-based method with refined smoothness model.
result Gluon's theoretical stepsizes match fine-tuned values, closing the theory-practice gap.

The paper evaluates and benchmarks electricity price forecasting models.

problem Lack of rigorous evaluation methods and open datasets.
method Literature review, cross-market comparison, open datasets, and python toolbox.
result Best practices for electricity price forecasting are proposed.

The positivity assumption, or the experimental treatment assignment (ETA) assumption, is important for identifiability in causal inference. Even if the positivity assumption holds, practical violations of this assumption may jeopardize the finite sample performance of the causal estimator. One of the consequences of pr…

2017-07-18abs ↗pdf ↗

Higher environmental performance linked to more tax avoidance, especially for financially constrained firms.

problem Tax avoidance practices in relation to environmental performance.
method Entropy balancing, propensity score matching, instrumental variable method, Heckman test.
result Higher environmental performance correlates with increased tax avoidance, particularly for financially constrained firms.

The study evaluates AI model performance measures for medical use.

problem Selecting appropriate performance measures for AI models in medical practice.
method Assessed 32 performance measures across five domains for binary outcomes.
result 17 measures are both proper and reflect decision-analytic performance.

Short-and-sparse deconvolution (SaSD) is the problem of extracting localized, recurring motifs in signals with spatial or temporal structure. Variants of this problem arise in applications such as image deblurring, microscopy, neural spike sorting, and more. The problem is challenging in both theory and practice, as na…

2019-08-28abs ↗pdf ↗

The study provides theoretical foundations for using smaller instances to predict algorithm performance on larger ones.

problem Scalability challenge in evaluating algorithms on large instances.
method Formalized size generalization, providing theoretical guarantees for predicting algorithm performance on large instances using smaller, representative instances.
result Characterized the subsample size sufficient to ensure performance on the subsample reflects performance on the full instance.

Differentially private learning on real-world data poses challenges for standard machine learning practice: privacy guarantees are difficult to interpret, hyperparameter tuning on private data reduces the privacy budget, and ad-hoc privacy attacks are often required to test model privacy. We introduce three tools to ma…

2018-12-07abs ↗pdf ↗

The paper tackles performative policy learning with strategic agents, improving scalability and generalizability.

problem Strategic agents adjust their features in response to a released policy, causing endogenous distribution shifts.
method Relaxing parametric assumptions, the paper uncovers a low-dimensional structure in distribution shifts and proposes a gradient-based policy optimization algorithm.
result The proposed algorithm achieves high sample efficiency and provides theoretical guarantees for convergence.

Look-Ahead-Bench evaluates financial LLMs for lookahead bias, revealing significant differences in model performance.

problem Measuring and mitigating lookahead bias in financial LLMs.
method Standardized benchmark evaluating model behavior in practical financial scenarios, analyzing performance decay across market regimes.
result Standard LLMs exhibit significant lookahead bias, while Pitinf models show improved generalization and reasoning abilities.

Researchers enhance EfficientNet models for practical efficiency on Graphcore IPU.

problem Improving practical efficiency of EfficientNet models on high-performance accelerators.
method Group convolutions, proxy-normalized activations, and reduced training resolution.
result Improves practical efficiency for both training and inference on Graphcore IPU.

We consider the problem of online planning in a Markov Decision Process when given only access to a generative model, restricted to open-loop policies - i.e. sequences of actions - and under budget constraint. In this setting, the Open-Loop Optimistic Planning (OLOP) algorithm enjoys good theoretical guarantees but is …

2019-04-09abs ↗pdf ↗

This paper reviews hyperparameter optimization methods and best practices.

problem Finding optimal hyperparameters for machine learning models.
method Various hyperparameter optimization methods are reviewed, including grid search, random search, evolutionary algorithms, Bayesian optimization, Hyperband, and racing.
result Practical recommendations for conducting hyperparameter optimization are provided.

Deep Reinforcement Learning has shown great success in a variety of control tasks. However, it is unclear how close we are to the vision of putting Deep RL into practice to solve real world problems. In particular, common practice in the field is to train policies on largely deterministic simulators and to evaluate alg…

2019-02-19abs ↗pdf ↗

Active learning (AL) is a widely-used training strategy for maximizing predictive performance subject to a fixed annotation budget. In AL one iteratively selects training examples for annotation, often those for which the current model is most uncertain (by some measure). The hope is that active sampling leads to bette…

2018-07-12abs ↗pdf ↗

Partially performative prediction studies how predictive models influence future data.

problem Distribution shift in predictive models due to endogenous and exogenous factors.
method Generalizing performative prediction to capture both endogenous and exogenous sources of distribution shift.
result Developed online analogues of performative stability and optimality for partially performative environments.

This paper improves multi-label ranking by reweighting univariate losses, enhancing consistency and performance.

problem Improving multi-label ranking performance while maintaining consistency.
method Systematic study of consistency and generalization error bounds for learning algorithms, proposing a reweighted univariate loss.
result Inconsistent pairwise losses can lead to better performance than consistent univariate losses in practice.

We consider wireless transmission of images in the presence of channel output feedback. From a Shannon theoretic perspective feedback does not improve the asymptotic end-to-end performance, and separate source coding followed by capacity-achieving channel coding, which ignores the feedback signal, achieves the optimal …

2019-11-25abs ↗pdf ↗

In training a deep learning system to perform audio transcription, two practical problems may arise. Firstly, most datasets are weakly labelled, having only a list of events present in each recording without any temporal information for training. Secondly, deep neural networks need a very large amount of labelled train…

2018-07-10abs ↗pdf ↗

The field of learning analytics needs to adopt a more rigorous approach for predictive model evaluation that matches the complex practice of model-building. In this work, we present a procedure to statistically test hypotheses about model performance which goes beyond the state-of-the-practice in the community to analy…

2018-02-16abs ↗pdf ↗

The paper clarifies conditions for using benchmark scores in machine learning.

problem Using benchmark scores to draw scientific inferences about learning problems.
method Developing conditions of construct validity inspired by psychological measurement theory.
result Clarifies conditions under which benchmark scores support diverse scientific claims.

Stochastic Gradient Descent (SGD) is widely used in machine learning problems to efficiently perform empirical risk minimization, yet, in practice, SGD is known to stall before reaching the actual minimizer of the empirical risk. SGD stalling has often been attributed to its sensitivity to the conditioning of the probl…

2017-02-01abs ↗pdf ↗

A practical algorithm improves approximate OT distances using quantization.

problem Substantial computational burden in computing OT distances for large samples.
method Introduces a quantization step to estimate OT distances between measures.
result The quantization step improves the performance of approximate solvers for entropy-regularized transport.

The NNGP kernel's predictions closely match those of the Matern kernel under certain conditions.

problem Comparing NNGP kernels to Matern kernels in practical applications.
method Demonstrated the necessity of normalization for NNGP kernels, explored numerical challenges, and compared predictions and performance.
result NNGP kernel predictions closely match Matern kernel predictions under specific circumstances.

We present here an introduction to Brainstorming approach, that was recently proposed as a consensus meta-learning technique, and used in several practical applications in bioinformatics and chemoinformatics. The consensus learning denotes heterogeneous theoretical classification method, where one trains an ensemble of…

2009-10-06abs ↗pdf ↗

Jointly tuning ensemble models improves performance and uncertainty calibration.

problem Improving both predictive performance and uncertainty calibration in deep ensembles.
method Investigated the impact of jointly tuning weight decay, temperature scaling, and early stopping.
result Jointly tuning ensemble models generally matches or improves performance, with significant variation across tasks.

New method for portfolio management learns from past wealth evolution.

problem Optimizing portfolio selection based on past performance.
method Simulated annealing clustering for asset selection, considering past wealth evolution.
result Strategy effectively learns from past performance and performs well in practice.