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

36912 · Jun 202019922001200920172026
48 results for coin betting

New algorithms learn latent variable models without tuning, outperforming existing methods.

problem Learning latent variable models without manual tuning.
method Two particle-based algorithms using free energy minimization and coin betting.
result Learning algorithms are entirely tuning-free and competitive with existing methods.

Deep learning methods achieve state-of-the-art performance in many application scenarios. Yet, these methods require a significant amount of hyperparameters tuning in order to achieve the best results. In particular, tuning the learning rates in the stochastic optimization process is still one of the main bottlenecks. …

2017-05-22abs ↗pdf ↗

New algorithms for sampling in constrained domains without learning rates.

problem Sampling in constrained domains with fairness constraints and post-selection inference.
method Coin betting ideas from convex optimisation and a unifying framework for constrained sampling.
result Our algorithms achieve competitive performance without hyperparameter tuning.

This paper explores using nonlinear control for robust logarithmic growth in coin flipping games.

problem Tackles the use of nonlinear control in recursive betting games with logarithmic growth.
method Formulates a robust nonlinear control problem for a simple coin flipping game, considering a probability range for the coin's bias.
result Provides a closed-form description of the optimal robust nonlinear controller, which outperforms linear controllers.

A key challenge in online learning is that classical algorithms can be slow to adapt to changing environments. Recent studies have proposed "meta" algorithms that convert any online learning algorithm to one that is adaptive to changing environments, where the adaptivity is analyzed in a quantity called the strongly-ad…

2017-11-06abs ↗pdf ↗

This paper describes a new parameter-free online learning algorithm for changing environments. In comparing against algorithms with the same time complexity as ours, we obtain a strongly adaptive regret bound that is a factor of at least log(T)\sqrt{\log(T)} better, where TT is the time horizon. Empirical results show tha…

2016-10-14abs ↗pdf ↗

The Kelly Criterion is applied to prediction markets to analyze risk and return.

problem Mean beliefs in prediction markets often differ from actual prices.
method Logarithmic utility and Kullback-Leibler divergence are used to study risk and return adjustments.
result Misjudgment of bias and investment fraction affect portfolio growth rate.

Inefficient markets allow investors to consistently outperform the market. To demonstrate that inefficiencies exist in sports betting markets, we created a betting algorithm that generates above market returns for the NFL, NBA, NCAAF, NCAAB, and WNBA betting markets. To formulate our betting strategy, we collected and …

2019-10-19abs ↗pdf ↗

Kelly betting is a prescription for optimal resource allocation among a set of gambles which are typically repeated in an independent and identically distributed manner. In this setting, there is a large body of literature which includes arguments that the theory often leads to bets which are "too aggressive" with resp…

2017-10-04abs ↗pdf ↗

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.

In the UK betting market, bookmakers often offer a free coupon to new customers. These free coupons allow the customer to place extra bets, at lower risk, in combination with the usual betting odds. We are interested in whether a customer can exploit these free coupons in order to make a sure gain, and if so, how the c…

2019-01-07abs ↗pdf ↗

This paper optimizes sports betting strategies using neural networks and portfolio theory.

problem Optimizing betting strategies in sports gambling.
method Combining neural network models with portfolio optimization, integrating Von Neumann-Morgenstern Expected Utility Theory and the Kelly Criterion.
result Achieved 135.8% relative profit during the English Premier League season.

New betting strategy reduces regret to ln(ln n) with protection against adversarial data.

problem Tackles the problem of minimizing regret in betting against adversarial and stochastic data.
method Combines insights from Robbins and Cover, using a mixture strategy.
result Exhibits a regret of O(ln(ln n)) on almost all paths, with O(log n) regret on the complement.

We introduce an evolutionary game with feedback between perception and reality, which we call the reality game. It is a game of chance in which the probabilities for different objective outcomes (e.g., heads or tails in a coin toss) depend on the amount wagered on those outcomes. By varying the `reality map', which rel…

2009-02-01abs ↗pdf ↗

We introduce a general framework for continuous-time betting markets, in which a bookmaker can dynamically control the prices of bets on outcomes of random events. In turn, the prices set by the bookmaker affect the rate or intensity of bets placed by gamblers. The bookmaker seeks a price process that maximizes his exp…

2019-07-01abs ↗pdf ↗

Testing-by-betting strategies almost surely go bankrupt under null hypotheses.

problem Understanding the behavior of betting strategies under null hypotheses.
method Analyzed the asymptotics of betting strategies under null distributions, focusing on the almost sure divergence of sums.
result Testing-by-betting strategies go bankrupt with probability one under any non-degenerate null distribution.

The betting CI outperforms classical methods in constructing confidence intervals for bounded means.

problem Constructing nonasymptotic confidence intervals for bounded means.
method A betting-based approach to define and time-uniform variants of confidence intervals (CSs).
result The betting CI matches the fundamental limits, outperforming existing empirical Bernstein CIs.

Study proposes new methods to convert betting odds into accurate probabilities for sports forecasting.

problem Convert betting odds to accurate outcome probabilities for sports forecasting and market efficiency analysis.
method Proposes two methods: Odds-Only-Equal-Profitability-Confidence (OO-EPC) and Favourite-Longshot-Bias-Adjusted Generalised Linear Model (FL-GLM).
result Proposed methods outperform existing methods in empirical tests and real-world applications.

Sequential tests for two-sample and independence testing using betting strategies.

problem Testing sequential data for two-sample and independence without kernel selection issues.
method Prediction-based betting strategies that adaptively determine distribution and joint distribution.
result Prediction-based tests outperform kernel-based approaches in high-dimensional or structured data settings.

New bounds derived using conditional ff-information for machine learning models.

problem Improving generalization bounds in machine learning.
method Introducing novel information-theoretic generalization bounds via conditional ff-information.
result Derives generalization bounds applicable to both bounded and unbounded loss functions.

A quantum memory model for Kelly betting with amplified or attenuated outcomes.

problem Optimizing Kelly betting strategies with quantum memory elements.
method Semi-classical model using quantum memory to encode payoff, modeled as random lasing dynamics.
result Best strategy is to invest all capital in coherent state amplitude for optimal performance.

The study shows how probability weighting can lead to betting in a risk-averse economy.

problem Understanding how probability weighting affects economic behavior and risk aversion.
method Examining a von Neumann-Morgenstern economy with an RDU agent to model probability weighting effects.
result Probability weighting can lead to endogenous betting in an economy with common beliefs.

We consider the problem of unconstrained online convex optimization (OCO) with sub-exponential noise, a strictly more general problem than the standard OCO. In this setting, the learner receives a subgradient of the loss functions corrupted by sub-exponential noise and strives to achieve optimal regret guarantee, witho…

2019-02-05abs ↗pdf ↗

This work examines the effects of allowing borrowing in betting-based hypothesis testing.

problem The impact of allowing borrowing in betting-based hypothesis testing.
method Examined the consequences of allowing borrowing in each round, adjusting the rejection threshold accordingly.
result There is no extra price to pay for the possibility of borrowing if a path-dependent threshold is used.

Study compares financial and gambling markets, finding similarities and potential applications.

problem Lack of comprehensive study on gambling markets compared to financial markets.
method Comprehensive comparison of five aspects: platform, product, procedure, participant, and strategy.
result Well-established financial strategies can be applied to gambling markets, particularly in peer-to-peer betting exchanges.