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.
Optimal strategies are found for a repeated betting game using diffusion approximation.
Convolutional networks struggle with repeating patterns in ECGs.
We study two systems of tangle equations that arise when modeling the action of the Integrase family of proteins on DNA. These two systems--direct and inverted repeats--correspond to two different possibilities for the initial DNA sequence. We present one new class of solutions to the tangle equations. In the case of i…
Study explores algorithmic collusion in repeated games using various learning dynamics.
Scorio.jl ranks systems from repeated tasks using various methods.
We investigate the question of when distinct branched surfaces in the complement of a 2-bridge knot support essential surfaces with identical boundary slopes. We determine all instances in which this occurs and identify an infinite family of knots for which no boundary slopes are repeated.
LAFF algorithm balances adaptability and non-exploitability in repeated games.
Link concordance and Whitney towers linked to Milnor invariants.
Risk is part of the fabric of every business; surprisingly, there is little work on establishing best practices for systematic, repeatable risk identification, arguably the first step of any risk management process. In this paper, we present a proposal that constitutes a more holistic risk management approach, a method…
It has long been known that a Milnor invariant with no repeated index is an invariant of link homotopy. We show that Milnor's invariants with repeated indices are invariants not only of isotopy, but also of self C_k-moves. A self C_k-move is a natural generalization of link homotopy based on certain degree k clasper su…
We investigate some geometric properties of the real algebraic variety of symmetric matrices with repeated eigenvalues. We explicitly compute the volume of its intersection with the sphere and prove a Eckart-Young-Mirsky-type theorem for the distance function from a generic matrix to points in . We exhibit conne…
This paper tackles the reduction of redundant repeating generation that is often observed in RNN-based encoder-decoder models. Our basic idea is to jointly estimate the upper-bound frequency of each target vocabulary in the encoder and control the output words based on the estimation in the decoder. Our method shows si…
Machine learning models for repeated measurements are limited. Using topological data analysis (TDA), we present a classifier for repeated measurements which samples from the data space and builds a network graph based on the data topology. When applying this to two case studies, accuracy exceeds alternative models wit…
Study optimizes product assortment for retailers with repeated exposures and patience costs.
Graph Neural Networks (GNNs) are based on repeated aggregations of information across nodes' neighbors in a graph. However, because common neighbors are shared between different nodes, this leads to repeated and inefficient computations. We propose Hierarchically Aggregated computation Graphs (HAGs), a new GNN graph re…
We present Sequential Attend, Infer, Repeat (SQAIR), an interpretable deep generative model for videos of moving objects. It can reliably discover and track objects throughout the sequence of frames, and can also generate future frames conditioning on the current frame, thereby simulating expected motion of objects. Th…
Study analyzes broker's gain from trade in repeated context-based trading.
A new method combines machine learning with mixed-effects models for better repeated measurement analysis.
Repeated self-distillation improves model performance significantly.
Whether stochastic or parametric, the Pareto/NBD model can only be utilized for an in-sample prediction rather than an out-of-sample prediction. This research thus provides a neural network based extension of the Pareto/NBD model to estimate the out-of-sample parameters, which overrides the estimation burden and the ap…
XSPNs combine SPNs and MEVMs for efficient inference in data with repeated parts.
Ribbon: Scalable Approximation and Robust Uncertainty Quantification
Serverless cloud computing speeds up double machine learning model estimation.
BILBO optimizes bilevel problems without repeated lower-level optimizations.
New algorithms minimize regret in repeated auctions by estimating values and optimizing bids.
In this paper we extend the investigation into the transition from sure to probabilistic sniping as introduced in Menkveld and Zoican \cite{mz2017}. In that paper, the authors introduce a stylized version of a competitive game in which high frequency traders (HFTs) interact with each other and liquidity traders. The au…
Predicts clinical events using a landmark approach with machine learning for large biomarker histories.
We study revenue optimization learning algorithms for repeated second-price auctions with reserve where a seller interacts with multiple strategic bidders each of which holds a fixed private valuation for a good and seeks to maximize his expected future cumulative discounted surplus. We propose a novel algorithm that h…
Central Counterparties (CCPs) are widely promoted as a requirement for safe banking with little dissent except on technical grounds (such as proliferation of CCPs). Whilst CCPs can have major operational positives, we argue that CCPs have many of the business characteristics of Rating Agencies, and face similar busines…
In this work we present Discrete Attend Infer Repeat (Discrete-AIR), a Recurrent Auto-Encoder with structured latent distributions containing discrete categorical distributions, continuous attribute distributions, and factorised spatial attention. While inspired by the original AIR model andretaining AIR model's capabi…
It is common to encounter situations where one must solve a sequence of similar computational problems. Running a standard algorithm with worst-case runtime guarantees on each instance will fail to take advantage of valuable structure shared across the problem instances. For example, when a commuter drives from work to…
New method detects heuristics in complex game strategies.
This study tackles mutual fund portfolio prediction, focusing on novel items.
The paper introduces a frequency-domain estimator for low-order systems from noisy data.
EIDGM model estimates DE parameters from RCS data.
Quantum algorithm speeds up nested expectation estimation by nearly quadratically.
Many real world tasks exhibit rich structure that is repeated across different parts of the state space or in time. In this work we study the possibility of leveraging such repeated structure to speed up and regularize learning. We start from the KL regularized expected reward objective which introduces an additional c…
The correlation matrix formalism is used to study temporal aspects of the stock market evolution. This formalism allows to decompose the financial dynamics into noise as well as into some coherent repeatable intraday structures. The present study is based on the high-frequency Deutsche Aktienindex (DAX) data over the t…
We describe an approximate dynamic programming (ADP) approach to compute approximations of the optimal strategies and of the minimal losses that can be guaranteed in discounted repeated games with vector-valued losses. Such games prominently arise in the analysis of regret in repeated decision-making in adversarial env…
The aim of this paper is to define the market-consistent multi-period value of an insurance liability cash flow in discrete time subject to repeated capital requirements, and explore its properties. In line with current regulatory frameworks, the approach presented is based on a hypothetical transfer of the original li…
Algorithm improves RL model selection for repeated games with utility maximization.
New approach speeds up optimization with repeated gradient steps on same batch.
CRAFT improves on existing methods for sampling complex distributions.
The paper analyzes how repeating epochs affects data scaling in linear regression.
We prove an explicit cabling formula for the colored Jones polynomial. As an application we prove the volume conjecture for all zero volume knots and links, i.e. all knots and links that are obtained from the unknot by repeated cabling and connected sum.
Motivated by online advertising auctions, we consider repeated Vickrey auctions where goods of unknown value are sold sequentially and bidders only learn (potentially noisy) information about a good's value once it is purchased. We adopt an online learning approach with bandit feedback to model this problem and derive …
Zoetrope Genetic Programming improves symbolic regression performance.
A wide class of machine learning algorithms can be reduced to variable elimination on factor graphs. While factor graphs provide a unifying notation for these algorithms, they do not provide a compact way to express repeated structure when compared to plate diagrams for directed graphical models. To exploit efficient t…