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.

169,051 papers · 148 categories

Trend · papers per month

35810 · Feb 202019922001200920182026
48 results for Lomax delegate racing

LDR models survival with competing risks using nonparametric Bayesian approach.

problem Survival analysis with competing risks and non-monotonic covariate effects.
method Lomax delegate racing, data augmentation, Gibbs sampler, stochastic gradient descent.
result Distinguished performance in survival analysis with competing risks.

Delegated votes in Uniswap DAO favor parties with less self-owned votes and a16z-affiliated entities.

problem Incentives for vote delegation in decentralized governance systems.
method Analysis of Uniswap governance DAO using vote delegation data.
result Vote delegation patterns suggest window-dressing around decentralization and merit-based delegation.

Forward hedging reshapes incentive provision in firms.

problem How does forward hedging affect incentive provision in firms?
method We consider a CARA framework to jointly characterize optimal production, compensation, and static hedging in equilibrium.
result Delegation and external hedging are partial substitutes, and delegation can increase firm value even when the agent is more risk averse.

Adaptive AI delegation framework for dynamic decision authority allocation.

problem Dynamic allocation of decision authority to AI-generated recommendations under evolving evidence quality and uncertainty.
method Formulated as a Governance-Aware POMDP, using Bayesian inference for informational state estimation and sequential optimization for authority allocation.
result Sequential Bayesian governance provides the strongest general-purpose policy across AI-quality regimes, adapting to evolving evidence.

Optimal contracts help principals delegate data collection in decentralized ML.

problem Dealing with information asymmetries in decentralized ML.
method Design of optimal and near-optimal contracts addressing uncertainty in model quality and performance.
result Simple linear contracts achieve 1-1/e fraction of optimal utility.

A study on portfolio delegation with random default times, addressing complex uncertainties.

problem Optimal portfolio delegation with uncertain investment horizon due to random default.
method Developed a theoretical framework using BSDEs and control theory, and deep learning for high-dimensional problems.
result Solutions to integro-partial Hamilton-Jacobi-Bellman equations for both scenarios of default time.

Study on limits of LLM-based multi-agent planning reliability.

problem Reliability limits of LLM-based multi-agent planning.
method Modeling LLM-based multi-agent architecture as a decision network, showing dominance by centralized Bayes decision maker.
result Optimizing multi-agent directed acyclic graphs under communication budget is equivalent to choosing a constrained experiment.

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.

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.

Private credit markets have expanded significantly, offering unique lending technology to private equity firms.

problem Understanding the growth and characteristics of private credit markets.
method Systematic survey of academic literature, development of integrated theoretical framework, empirical evidence.
result Private credit markets offer a distinct lending technology with higher spreads over syndicated loans.

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.

We analyze conditional optimization problems arising in discrete time Principal-Agent problems of delegated portfolio optimization with linear contracts. Applying tools from Conditional Analysis we show that some results known in the literature for very specific instances of the problem carry over to translation invari…

2014-12-15abs ↗pdf ↗

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.

We propose a Monte Carlo simulation method to generate stress tests by VaR scenarios under Solvency II for dependent risks on the basis of observed data. This is of particular interest for the construction of Internal Models and requirements on evaluation processes formulated in the Commission Delegated Regulation. The…

2018-08-07abs ↗pdf ↗

New method debiases word embeddings for multiclass settings like race and religion.

problem Word embeddings in online texts perpetuate human stereotypes, including race and religion.
method Proposes a novel methodology to debias word embeddings in multiclass settings.
result Demonstrates robust multiclass debiasing that maintains NLP task efficacy.

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.

New framework improves fraud prediction with incremental data balancing for massive data streams.

problem Class imbalance problem in massive imbalanced data streams.
method Incremental data balancing framework using Racing Algorithm for automated balancing and Random Forest for classification.
result Better results than Batch mode on European Credit Card dataset.

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 ↗

The paper examines fairness issues in decision-making systems when protected class labels are unobserved.

problem Fairness assessment challenges when protected class labels are unavailable.
method Decomposes biases in estimating outcome disparity via threshold-based imputation and proposes a weighted estimator.
result Threshold-based imputation generally overestimates disparities, while the weighted estimator has a simpler negative bias.

Perceptual ad-blocking is vulnerable to attacks, creating new security risks.

problem Vulnerability of perceptual ad-blocking to attacks and new security risks.
method Analysis and creation of adversarial examples to bypass perceptual ad-blocking.
result Perceptual ad-blocking can be bypassed using adversarial examples, introducing new security risks.