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 · May 202619922001200920172026
48 results for winning streaks

Study geodesic X-ray transform and streaking artifacts on simple surfaces or spaces of constant curvature.

problem Streaking artifacts in CT images due to metal regions.
method Geodesic X-ray transform on nontrapping compact Riemannian manifolds with strictly convex boundaries.
result Streaking artifacts result from conormal singularities along common tangent geodesics.

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 proposes a new method to forecast winning prices in real-time bidding.

problem Accurately forecasting winning prices in real-time bidding with limited data.
method The paper introduces a heteroscedastic fully parametric censored regression approach and a mixture density censored network.
result The proposed method significantly improves winning price forecasting compared to existing methods.

Paper confirms winning tickets have sharp minima, useful for generalization.

problem Explaining why over-parameterized models generalize well despite having sharp minima.
method PAC-Bayesian theory applied to analyze winning tickets and their generalization behavior.
result PAC-Bayesian theory confirms winning tickets have relatively sharp minima, a disadvantage for generalization.

In-game win probability models, which provide a sports team's likelihood of winning at each point in a game based on historical observations, are becoming increasingly popular. In baseball, basketball and American football, they have become important tools to enhance fan experience, to evaluate in-game decision-making,…

2019-06-12abs ↗pdf ↗

This paper discusses the gambling contest introduced in Seel & Strack (Gambling in contests, Discussion Paper Series of SFB/TR 15 Governance and the Efficiency of Economic Systems 375, Mar 2012.) and considers the impact of adding a penalty associated with failure to follow a winning strategy. The Seel & Strack model c…

2013-01-04abs ↗pdf ↗

Calculates winning probability for three candidates based on support rates and information timing.

problem Determining optimal strategy for three candidates in an election.
method Closed-form solution using support rates, political spectrum positioning, time left, and information revelation rate.
result Optimal strategy can be complex, especially for candidates in the center of a polarized electorate.

The thesis explores IMP, a process that identifies winning tickets in DNNs, and its universality.

problem Understanding how winning subnetworks (tickets) perform across different problems.
method Iterative Magnitude Pruning (IMP) and comparison with Renormalisation Group (RG) theory.
result IMP identifies winning subnetworks that can perform similarly across various problems.

Paper tackles learning win-win solutions in aggregation systems.

problem Learning approximate equilibrium solutions in aggregation systems to keep suppliers.
method Multi-Agent Reinforcement Learning (MARL) with variance reduction mechanism.
result Approach reduces value variance and moves joint solution closer to Nash Equilibrium.

Model analyzes RFQ markets using stochastic control to optimize dealer performance and inventory.

problem Optimizing market making in aggregator-routed RFQ markets with varying dealer performance scores.
method Two-tier stochastic control model that separates RFQ-level price competition from macro routing.
result Optimal controls can be expressed through derivatives of reduced Hamiltonians, leading to interpretable mappings from optimal win probabilities to optimal offsets.

Trading strategies that were profitable in the past often degrade with time. Since unlucky streaks can also hit "healthy" strategies, how can one detect that something truly worrying is happening? It is intuitive that a drawdown that lasts too long or one that is too deep should lead to a downward revision of the assum…

2017-07-05abs ↗pdf ↗

Diagnostic stroke imaging with C-arm cone-beam computed tomography (CBCT) enables reduction of time-to-therapy for endovascular procedures. However, the prolonged acquisition time compared to helical CT increases the likelihood of rigid patient motion. Rigid motion corrupts the geometry alignment assumed during reconst…

2019-10-09abs ↗pdf ↗

The paper calculates gap distributions for translation surfaces, focusing on the double heptagon.

problem Calculating gap distributions for translation surfaces.
method Describes a procedure to find winning holonomy vectors and applies it to the double heptagon.
result Explicitly computed gap distribution for the regular double heptagon translation surface.

The study analyzes games and social hierarchies, incorporating luck and depth of competition.

problem Analyzing patterns of wins and losses in games and social hierarchies.
method Generalized probabilistic models incorporating luck and depth of competition.
result Social competition tends to be deeper with many distinct levels, but there is often a chance of upset victories.

Faster WIND accelerates iterative BOND for LLM alignment.

problem Iterative BOND is inefficient in practice due to sample and computation inefficiency.
method Unified game-theoretic connection to self-play alignment, WIND framework with efficient algorithms.
result WIND variant achieves superior sample efficiency and faster computation.

The Lucas critique has exposed the problem of the trade-off between changes in monetary policy and structural breaks in economic time series. The search for and characterisation of such breaks has been a major econometric task ever since. We have developed an integral technique similar to CUSUM using an empirical model…

2011-03-30abs ↗pdf ↗

The Tangent Works team participated in GEFCom 2017 to test its automatic model building strategy for time series known as Tangent Information Modeller (TIM). Model building using TIM combined with historical temperature shuffling resulted in winning the competition. This strategy involved one remaining degree of freedo…

2019-04-12abs ↗pdf ↗

For homeland and transportation security applications, 2D X-ray explosive detection system (EDS) have been widely used, but they have limitations in recognizing 3D shape of the hidden objects. Among various types of 3D computed tomography (CT) systems to address this issue, this paper is interested in a stationary CT u…

2018-01-04abs ↗pdf ↗

Combinatorial two-player games have recently been applied to knot theory. Examples of this include the Knotting-Unknotting Game and the Region Unknotting Game, both of which are played on knot shadows. These are turn-based games played by two players, where each player has a separate goal to achieve in order to win the…

2018-07-29abs ↗pdf ↗

We study the relationship between social media output and National Football League (NFL) games, using a dataset containing messages from Twitter and NFL game statistics. Specifically, we consider tweets pertaining to specific teams and games in the NFL season and use them alongside statistical game data to build predic…

2013-10-25abs ↗pdf ↗

We solve exactly a simple model of trend following strategy, and obtain the analytical shape of the profit per trade distribution. This distribution is non trivial and has an option like, asymmetric structure. The degree of asymmetry depends continuously on the parameters of the strategy and on the volatility of the tr…

2005-08-16abs ↗pdf ↗

We continue the study of statistical/computational tradeoffs in learning robust classifiers, following the recent work of Bubeck, Lee, Price and Razenshteyn who showed examples of classification tasks where (a) an efficient robust classifier exists, in the small-perturbation regime; (b) a non-robust classifier can be l…

2019-02-04abs ↗pdf ↗

Pruning FCNs reveals sub-networks that match CNNs' performance.

problem Understanding the inductive bias of pruning in neural networks.
method Iterative magnitude pruning of a simple FCN followed by analysis of the resulting architecture.
result Pruned FCNs exhibit key features of CNNs, suggesting new architectural biases.
Agents Play Mix-gamephysics.soc-ph

In mix-game which is an extension of minority game, there are two groups of agents; group1 plays the majority game, but the group2 plays the minority game. This paper studies the change of the average winnings of agents and volatilities vs. the change of mixture of agents in mix-game model. It finds that the correlatio…

2005-05-17abs ↗pdf ↗

State-space models win a forecasting competition for unstable data.

problem Forecasting electricity demand during the post-covid period.
method Adapting state-space models to balance time-series adaptability and machine learning complexity.
result State-space models provide a better compromise between adaptability and accuracy for non-stationary data.

Improved MACD trading strategies with other indicators for better performance.

problem Evaluating the effectiveness of MACD-based trading strategies in the US stock market.
method Backtested various MACD-based trading strategies on US stock indices using Python.
result Win-rate of MACD strategies improved with other momentum indicators, leading to a new VPVMA indicator.

Given a set of pairwise comparisons, the classical ranking problem computes a single ranking that best represents the preferences of all users. In this paper, we study the problem of inferring individual preferences, arising in the context of making personalized recommendations. In particular, we assume that there are …

2015-02-16abs ↗pdf ↗