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

19395877 · Jun 202019922001200920172026
48 results for batch racing

New method detects bearing faults using multivariate statistical process control.

problem Early detection of bearing faults in rotating machinery.
method Multivariate statistical process control charts applied to Fourier transform features of fixed-time batches.
result Effectiveness in detecting bearing faults across different conditions.

Reduces gender classification bias by learning race-invariant face representations.

problem Societal bias in gender recognition systems.
method Adversarially trained autoencoder model to learn race-invariant face representations.
result Achieved a significant drop of over 40% in racial bias surrogate metric with race invariant representations.

Develops a learning model predictive controller for competitive racing.

problem Lack of exploration in state space and complexity in obstacle avoidance.
method Explores state space through multiple initializations and develops a new method for convex terminal set selection.
result Yields a richer terminal safe set and maintains convexity.

Modeling horse race betting odds with Ornstein-Uhlenbeck process.

problem Analyzing how herding and informed bettors affect odds movements.
method Deriving an Ornstein-Uhlenbeck process from vote shares and odds movements data.
result Identified microscopic and macroscopic patterns in odds convergence.

Deep RL drone trained to compete against classical path planning in drone racing.

problem Optimizing long-term drone racing strategies using reinforcement learning.
method Used PPO algorithm on a simulated quadrotor in a racing environment created with AirSim.
result Deep RL agent outperformed classical path planning in drone racing competitions.

PAC best arm identification with a deadline, improving efficiency over sequential methods.

problem Identifying an optimal arm under a fixed time constraint.
method Elastic Batch Racing (EBR) algorithm for (ε,δ)(ε, δ)-PAC best arm identification under a deadline.
result EBR is optimal with respect to two hardness results and outperforms sequential methods.

DeepRacing uses neural networks to predict trajectories for autonomous racing in video games.

problem Training algorithms for high-speed autonomous racing in realistic environments.
method Developed a virtual testbed using F1 video games, trained neural networks to predict trajectories and control commands.
result Trajectory prediction outperforms end-to-end control methods in autonomous racing simulations.

To answer questions about racial inequality and fairness, we often need a way to infer race and ethnicity from names. One way to infer race and ethnicity from names is by relying on the Census Bureau's list of popular last names. The list, however, suffers from at least three limitations: 1. it only contains last names…

2018-05-05abs ↗pdf ↗

Improved surname geocoding and name supplements enhance race imputation accuracy.

problem Census data problems affecting race imputation accuracy.
method Fully Bayesian Improved Surname Geocoding (fBISG) and name supplements.
result Significant improvement in race imputation accuracy across all racial groups.

ProMoD models human race drivers with probabilistic movement primitives and neural networks.

problem Challenging task of modeling human driver behavior due to variability and complexity.
method Modular framework with Probabilistic Movement Primitives, clothoids, and neural networks.
result Significant advantages in imitation accuracy and robustness compared to other algorithms.

Lognormal distribution used for predicting team rankings in an orienteering relay race.

problem Predicting final team rankings in an orienteering relay race.
method Used lognormal distribution and Fenton-Wilkinson approximations for order statistics.
result Accurate predictions of team rankings using order statistics.

A new model predicts race places using changeover-times and log-normal distributions.

problem Predicting race places in orienteering races.
method Fenton-Wilkinson Order Statistics model based on log-normal leg-times and changeover-times.
result The model accurately predicts race places with smaller root-mean-square-errors.

New analysis shows rational actors will deploy AGI despite negative social value due to catastrophic risk.

problem Rational actors will deploy AGI despite negative social value due to shared catastrophic risk.
method Continuous-time preemption game with shared catastrophic externalities, showing suicide region and welfare distortion.
result The suicide region widens as catastrophic risk grows, and two mechanisms can close it.

This work improves autonomous racing by creating diverse opponents and adapting risk.

problem Balancing performance and safety in autonomous racing environments.
method Developed a self-play method using replica-exchange Markov chain Monte Carlo for diverse opponents and a distributionally robust bandit optimization for adaptive risk adjustment.
result Demonstrated real-time motion-planning methods achieving speeds comparable to Formula One racecars.

Study compares SPG and PPO for racing games, finding SPG more stable with weighted actions.

problem Training continuous action reinforcement learning algorithms for racing games.
method Introduced novel racing environment, tested SPG and PPO with modifications and experience replay.
result Experience replay not beneficial for PPO in continuous action spaces, SPG more stable with weighted actions.

We find a remarkable agreement between the statistics of a randomly divided interval and the observed statistical patterns and distributions found in horse racing betting markets. We compare the distribution of implied winning odds, the average true winning probabilities, the implied odds conditional on a win, and the …

2016-12-08abs ↗pdf ↗

A deep RL approach generates counterfactual instances efficiently.

problem Efficient generation of counterfactual instances for large datasets and diverse models.
method Deep reinforcement learning to optimize counterfactual instances in a single forward pass.
result Model-agnostic and scalable counterfactual generation.

In the automation of many kinds of processes, the observable outcome can often be described as the combined effect of an entire sequence of actions, or controls, applied throughout its execution. In these cases, strategies to optimise control policies for individual stages of the process might not be applicable, and in…

2018-02-17abs ↗pdf ↗

Predictive modeling is increasingly being employed to assist human decision-makers. One purported advantage of replacing human judgment with computer models in high stakes settings-- such as sentencing, hiring, policing, college admissions, and parole decisions-- is the perceived "neutrality" of computers. It is argued…

2016-10-25abs ↗pdf ↗

"Overlearning" means that a model trained for a seemingly simple objective implicitly learns to recognize attributes and concepts that are (1) not part of the learning objective, and (2) sensitive from a privacy or bias perspective. For example, a binary gender classifier of facial images also learns to recognize races…

2019-05-28abs ↗pdf ↗

Study analyzes financial distributions and inequality in professional cycling teams.

problem Financial inequality and concentration among cycling teams.
method Rank-size law and various inequality indices applied to Tour de France data.
result Financial gains distribution is hyperbolic with a decay exponent of about -1, contrary to Pareto principle.

New research shows many batch selection methods for training work just as well as full batch training.

problem Finding optimal batch selection methods for training.
method Analysis of mini-batch Gradient Descent (GD) and Stochastic GD (SGD) with various batch selection rules.
result All mini-batch schedules, including deterministic ones, generalize optimally for smooth Lipschitz-convex/nonconvex/strongly-convex loss functions.

Determining the appropriate batch size for mini-batch gradient descent is always time consuming as it often relies on grid search. This paper considers a resizable mini-batch gradient descent (RMGD) algorithm based on a multi-armed bandit for achieving best performance in grid search by selecting an appropriate batch s…

2017-11-17abs ↗pdf ↗

FRN layer eliminates batch dependence in deep learning, improving performance across various tasks.

problem Batch Normalization's dependency on mini-batch elements can degrade performance for small batches.
method Filter Response Normalization (FRN) operates independently on each activation channel of each batch element.
result FRN layer outperforms BN and other alternatives in various settings for all batch sizes.

Ensemble Kalman methods improve climate model calibration from noisy observations.

problem Calibrating parameters in complex climate models from noisy data.
method Comparing ensemble Kalman methods for efficiency in climate model calibration.
result Ensemble Kalman methods are more efficient and robust for parameter learning in climate models.

Machine learning outperforms crowd investors in predicting loan defaults and investment returns.

problem Determining if machine learning can outperform human decision-making in crowd lending.
method Using data from Prosper.com, a sophisticated ML algorithm was trained to predict loan defaults and investment returns.
result The ML algorithm outperforms crowd investors in predicting loan defaults and investment returns, especially for risky loans.