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

15.0%30.0%45.0%60.0% · Jun 202019922001200920172026
48 results for baseline learning

Algorithm safely learns from sub-optimal baseline policies while satisfying constraints.

problem Safe reinforcement learning with constraints when baseline policy is sub-optimal.
method Iterative policy optimization alternating between return maximization, baseline distance minimization, and constraint projection.
result Consistently outperforms baselines, achieving 10x fewer constraint violations and 40% higher reward.

The study introduces backward baselines to distinguish past prediction from future prediction in machine learning models.

problem Differentiating between past and future prediction in machine learning models.
method Theoretical, empirical, and normative arguments support a family of simple and efficient statistical tests called backward baselines.
result The study provides a meaningful backward baseline for auditing black-box prediction systems.

Bayesian Scattering offers a simple baseline for image data uncertainty.

problem Lack of interpretable, mathematically grounded uncertainty quantification methods for image data.
method Coupling wavelet scattering transform with a simple probabilistic head.
result Bayesian Scattering provides sensible uncertainty estimates under distribution shifts.

Investigates Q value evolution in Stable Baselines for DQL in simple vs complex environments.

problem DQL in Stable Baselines struggles with simple non-game environments.
method Comparison of TrafficLight and FrozenLake environments; Q value decomposition analysis.
result Q values meander far from optimal in complex relationships between states.

Like all sub-fields of machine learning Bayesian Deep Learning is driven by empirical validation of its theoretical proposals. Given the many aspects of an experiment it is always possible that minor or even major experimental flaws can slip by both authors and reviewers. One of the most popular experiments used to eva…

2018-11-23abs ↗pdf ↗

Policy gradient methods are a widely used class of model-free reinforcement learning algorithms where a state-dependent baseline is used to reduce gradient estimator variance. Several recent papers extend the baseline to depend on both the state and action and suggest that this significantly reduces variance and improv…

2018-02-27abs ↗pdf ↗

Previous work has shown the unreliability of existing algorithms in the batch Reinforcement Learning setting, and proposed the theoretically-grounded Safe Policy Improvement with Baseline Bootstrapping (SPIBB) fix: reproduce the baseline policy in the uncertain state-action pairs, in order to control the variance on th…

2019-09-11abs ↗pdf ↗

Dark Experience improves continual learning with a simple, strong baseline.

problem General Continual Learning in scenarios where tasks are not sequential and offline training is not possible.
method Mixing rehearsal with knowledge distillation and regularization.
result Dark Experience outperforms consolidated approaches and leverages limited resources.

Human language is a rich multimodal signal consisting of spoken words, facial expressions, body gestures, and vocal intonations. Learning representations for these spoken utterances is a complex research problem due to the presence of multiple heterogeneous sources of information. Recent advances in multimodal learning…

2019-05-14abs ↗pdf ↗

This work establishes safe reinforcement learning for LQR with nonlinear baselines.

problem Safe reinforcement learning in LQR with unknown dynamics and safety constraints.
method General framework for nonlinear baselines, focusing on 1D spaces.
result Achieves optimal regret bounds for constrained reinforcement learning.

How can we design safe reinforcement learning agents that avoid unnecessary disruptions to their environment? We show that current approaches to penalizing side effects can introduce bad incentives, e.g. to prevent any irreversible changes in the environment, including the actions of other agents. To isolate the source…

2018-06-04abs ↗pdf ↗

Study identifies and analyzes spurious correlations in data-driven models.

problem Spurious correlations in data-driven models are unreliable and hard to detect.
method Collect and analyze synthetic datasets generated from causal graphs to investigate spurious correlations.
result Patterns connecting spurious correlation hypotheses and model design choices were observed.

Safe RL in linear systems achieves T\sqrt{T}-regret.

problem Efficiently learning in safety-constrained online reinforcement learning.
method Study of linear quadratic regulator with safety constraints.
result First safe algorithm with ildeOT(T) ilde{O}_T(\sqrt{T})-regret.

A training-free conformal interval is a mandatory baseline for probabilistic time-series forecasting.

problem Comparing probabilistic forecasters against weak or omitted baselines.
method A simple conformal interval with no parameters and no training.
result The ConformalNaive interval decisively beats several baselines.

Node-perturbation learning is a type of statistical gradient descent algorithm that can be applied to problems where the objective function is not explicitly formulated, including reinforcement learning. It estimates the gradient of an objective function by using the change in the object function in response to the per…

2017-06-20abs ↗pdf ↗

New learned optimizers outperform baselines by incorporating known and novel mechanisms.

problem Understanding how learned optimizers outperform traditional ones.
method Careful analysis and visualization of learned optimizers trained on various tasks.
result Learned optimizers incorporate known techniques like momentum and gradient clipping, as well as new forms of learning rate adaptation.

Paper compares two local explanation methods for machine learning models.

problem Comparing two local explanation methods for machine learning models.
method Integrated Gradients and Baseline Shapley methods.
result Additional insights on comparative behavior for tabular data and neural networks.

There exist a number of reinforcement learning algorithms which learnby climbing the gradient of expected reward. Their long-runconvergence has been proved, even in partially observableenvironments with non-deterministic actions, and without the need fora system model. However, the variance of the gradient estimator ha…

2013-01-10abs ↗pdf ↗

Proposes baselines for joint NAS and HPO optimization.

problem Joint optimization of neural architecture and hyperparameters for multiple objectives.
method Extends existing methods to jointly optimize with multiple objectives.
result Serves as simple baselines for future multi-objective joint NAS + HPO research.

This paper presents the recently published Cerema AWP (Adverse Weather Pedestrian) dataset for various machine learning tasks and its exports in machine learning friendly format. We explain why this dataset can be interesting (mainly because it is a greatly controlled and fully annotated image dataset) and present base…

2018-06-11abs ↗pdf ↗

Paper formalizes continual semi-supervised anomaly detection, showing promising results.

problem Formalizing continual semi-supervised anomaly detection in real-world conditions.
method Baseline model of variational autoencoder (VAE) with deep generative replay and outlier rejection.
result Outlier rejection shows promising results, often surpassing baseline methods.

A simple baseline outperforms deep learning methods in transportation forecasting.

problem The importance of stationarity and recurrent patterns in transportation data.
method A naive baseline based on average weekly patterns and linear regression.
result The baseline method achieves comparable or better results than state-of-the-art deep learning approaches.

This research secures deployed sentiment analysis models by identifying and defending against attack vectors.

problem Securing deployed machine learning models, particularly sentiment analysis systems, from adversarial attacks.
method BAD (Build, Attack, Defend) Architecture, evaluating two implementations.
result Demonstrated a viable methodology for securing machine learning models in production.

Study proposes learning optimal priors from data for better Bayesian inference.

problem Challenges the use of noninformative uniform priors in Bayesian inference.
method Machine learning approach to learn optimal priors from data using a target function.
result Study models consistently outperformed baseline models in Wikipedia category classification.

Enhanced visual feature attribution via adaptive baseline weighting.

problem IG's sensitivity to baseline images leads to noisy or unstable explanations.
method Weighted Integrated Gradients (WG) evaluates and weights baselines for improved reliability.
result WG improves over Expected Gradients (EG) by up to 36% across various models.

BASIS improves LLM reasoning by sharing batchwise rollout info, reducing MSE by 69%.

problem Improving large language model reasoning with limited rollouts and batch information.
method BASIS samples only one rollout per prompt but uses batch information to improve value function estimation.
result BASIS reduces MSE in value function estimation by 69% compared to REINFORCE++.

WiGS improves active learning for regression by dynamically selecting informative samples.

problem Reducing labeling costs in regression tasks.
method Formulated as a reinforcement learning problem, WiGS adapts the exploration-investigation balance.
result WiGS outperforms static methods in accuracy and labeling efficiency, especially in irregular data density.

The paper reveals that baselines significantly impact RL algorithms' convergence.

problem Understanding the true impact of baselines on policy optimization.
method Theoretical analysis of bandit and RL problems, focusing on natural policy gradient and EXP3.
result Baselines can determine algorithm convergence, contradicting traditional optimization theory.

Time series foundation models are well-calibrated, improving over baseline models.

problem Calibration of time series foundation models for practical applications.
method Systematic evaluations of five time series foundation models and two baselines, assessing calibration, prediction heads, and long-term forecasting.
result Time series foundation models are consistently better calibrated than baseline models and do not show over- or under-confidence.

New linear algorithms improve wSVMs for multiclass probability estimation.

problem Estimating conditional probabilities for multiclass problems.
method Proposed baseline learning and OVA learning schemes to improve wSVMs.
result Linear algorithms achieve optimal computational efficiency and good estimation accuracy.

In this work we describe the preparation of a time series dataset of inertial measurements for determining the surface type under a wheeled robot. The data consists of over 7600 labeled time series samples, with the corresponding surface type annotation. This data was used in two public competitions with over 1500 part…

2019-05-01abs ↗pdf ↗

Enhances survival analysis by separating population behavior from individual dynamics.

problem Improving the training and inference of survival analysis models for sparsely occurring events.
method Decouples survival analysis into an aggregated baseline hazard and independent survival scores.
result Achieves competitive performance and robust results without fine-tuning.