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.
Study explores strategies for randomized allocation in delayed rewards bandits.
Not all types of supervision signals are created equal: Different types of feedback have different costs and effects on learning. We show how self-regulation strategies that decide when to ask for which kind of feedback from a teacher (or from oneself) can be cast as a learning-to-learn problem leading to improved cost…
We construct infinite sequences of pseudo-Anosov homeomorphisms without fixed points and leaving invariant a sequence of orientable measured foliations on the same topological surface and the same stratum of the space of abelian differentials. The existence of such sequences show that all pseudo-Anosov homeomorphisms f…
We show that the following unlinking strategy does not always yield an optimal sequence of crossing changes: first split the link with the minimal number of crossing changes, and then unknot the resulting components.
The celebrated Sequence to Sequence learning (Seq2Seq) technique and its numerous variants achieve excellent performance on many tasks. However, many machine learning tasks have inputs naturally represented as graphs; existing Seq2Seq models face a significant challenge in achieving accurate conversion from graph form …
This paper studies stability of the exponential utility maximization when there are small variations on agent's utility function. Two settings are considered. First, in a general semimartingale model where random endowments are present, a sequence of utilities defined on R converges to the exponential utility. Under a …
In this work we compare different batch construction methods for mini-batch training of recurrent neural networks. While popular implementations like TensorFlow and MXNet suggest a bucketing approach to improve the parallelization capabilities of the recurrent training process, we propose a simple ordering strategy tha…
We argue that the existing regret matchings for Nash equilibrium approximation conduct "jumpy" strategy updating when the probabilities of future plays are set to be proportional to positive regret measures. We propose a geometrical regret matching which features "smooth" strategy updating. Our approach is simple, intu…
Study efficient rebalancing strategies for portfolio tracking error.
A model learns stock trading rules from raw prices using encoder-decoder neural network.
Machine learning and data mining techniques have been used extensively in order to detect credit card frauds. However, most studies consider credit card transactions as isolated events and not as a sequence of transactions. In this article, we model a sequence of credit card transactions from three different perspectiv…
We consider Lipschitz-type backward stochastic differential equations (BSDEs) driven by cylindrical martingales on the space of continuous functions. We show the existence and uniqueness of the solution of such infinite-dimensional BSDEs and prove that the sequence of solutions of corresponding finite-dimensional BSDEs…
In this paper we consider the problem of how a reinforcement learning agent that is tasked with solving a sequence of reinforcement learning problems (a sequence of Markov decision processes) can use knowledge acquired early in its lifetime to improve its ability to solve new problems. We argue that previous experience…
Study proves upper semicontinuity of index plus nullity for minimal and H-CMC hypersurfaces.
Machine learning and data mining techniques have been used extensively in order to detect credit card frauds. However, most studies consider credit card transactions as isolated events and not as a sequence of transactions. In this framework, we model a sequence of credit card transactions from three different perspect…
Neural approaches to sequence labeling often use a Conditional Random Field (CRF) to model their output dependencies, while Recurrent Neural Networks (RNN) are used for the same purpose in other tasks. We set out to establish RNNs as an attractive alternative to CRFs for sequence labeling. To do so, we address one of t…
This paper explores the problem of unknotting closed braids and classical knots in mathematical knot theory. We apply evolutionary computation methods to learn sequences of moves that simplify knot diagrams, and show that this can be effective both when the evolution is carried out for individual knots and when a gener…
We uncover a fairly general principle in online learning: If regret can be (approximately) expressed as a function of certain "sufficient statistics" for the data sequence, then there exists a special Burkholder function that 1) can be used algorithmically to achieve the regret bound and 2) only depends on these suffic…
Develops a new method for risk diversification using dynamic risk measures.
We prove the existence of optimal strategies for agents with cumulative prospect theory preferences who trade in a continuous-time illiquid market, transcending known results which pertained only to risk-averse utility maximizers. The arguments exploit an extension of Skorohod's representation theorem for tight sequenc…
Reinforcement Patching optimizes dynamic sequence patching for efficient time series forecasting.
Sampling strategies significantly affect feature approximations in ELA, impacting classifier accuracy.
Study shows aperiodic sequences enhance Parrondo's effect, with Thue-Morse outperforming others.
Automatic speech recognition can potentially benefit from the lip motion patterns, complementing acoustic speech to improve the overall recognition performance, particularly in noise. In this paper we propose an audio-visual fusion strategy that goes beyond simple feature concatenation and learns to automatically align…
As deep learning techniques advance more than ever, hyper-parameter optimization is the new major workload in deep learning clusters. Although hyper-parameter optimization is crucial in training deep learning models for high model performance, effectively executing such a computation-heavy workload still remains a chal…
Grammatical Error Correction (GEC) has been recently modeled using the sequence-to-sequence framework. However, unlike sequence transduction problems such as machine translation, GEC suffers from the lack of plentiful parallel data. We describe two approaches for generating large parallel datasets for GEC using publicl…
Undirected neural sequence models such as BERT (Devlin et al., 2019) have received renewed interest due to their success on discriminative natural language understanding tasks such as question-answering and natural language inference. The problem of generating sequences directly from these models has received relativel…
We extend the framework of trading strategies of Gatheral [2010] from single stocks to a pair of stocks. Our trading strategy with the executions of two round-trip trades can be described by the trading rates of the paired stocks and the ratio of their trading periods. By minimizing the potential cost arising from cros…
Microbial clades modeling is a challenging problem in biology based on microarray genome sequences, especially in new species gene isolates discovery and category. Marker family genome sequences play important roles in describing specific microbial clades within species, a framework of support vector machine (SVM) base…
Paper improves recommendation systems by optimizing sequence of items for clicks.
Improves spatio-temporal forecasting by reducing errors between training and inference.
This paper introduces a new class of Dynkin games, where the two players are allowed to make their stopping decisions at a sequence of exogenous Poisson arrival times. The value function and the associated optimal stopping strategy are characterized by the solution of a backward stochastic differential equation. The pa…
Missing value imputation is a fundamental problem in spatiotemporal modeling, from motion tracking to the dynamics of physical systems. Deep autoregressive models suffer from error propagation which becomes catastrophic for imputing long-range sequences. In this paper, we take a non-autoregressive approach and propose …
We propose a novel adversarial learning strategy for mixture models of Hawkes processes, leveraging data augmentation techniques of Hawkes process in the framework of self-paced learning. Instead of learning a mixture model directly from a set of event sequences drawn from different Hawkes processes, the proposed metho…
Solving the RNA inverse folding problem is a critical prerequisite to RNA design, an emerging field in bioengineering with a broad range of applications from reaction catalysis to cancer therapy. Although significant progress has been made in developing machine-based inverse RNA folding algorithms, current approaches s…
A game theory study on optimal hiding and searching strategies in discrete locations.
Avanzi et al. (2016) recently studied an optimal dividend problem where dividends are paid both periodically and continuously with different transaction costs. In the Brownian model with Poissonian periodic dividend payment opportunities, they showed that the optimal strategy is either of the pure-continuous, pure-peri…
Study optimal hedging for claims with random weights in discrete time.
A faster method for optimizing DNA and protein sequences using machine learning.
For the stochastic multi-armed bandit (MAB) problem from a constrained model that generalizes the classical one, we show that an asymptotic optimality is achievable by a simple strategy extended from the -greedy strategy. We provide a finite-time lower bound on the probability of correct selection of an optimal ne…
For training the sequence-to-sequence voice conversion model, we need to handle an issue of insufficient data about the number of speech pairs which consist of the same utterance. This study experimentally investigated the effects of Mel-spectrogram augmentation on training the sequence-to-sequence voice conversion (VC…
This paper analyzes the problem of starting and stopping a Cox-Ingersoll-Ross (CIR) process with fixed costs. In addition, we also study a related optimal switching problem that involves an infinite sequence of starts and stops. We establish the conditions under which the starting-stopping and switching problems admit …
This study mainly investigates two common decoding problems in neural keyphrase generation: sequence length bias and beam diversity. To tackle the problems, we introduce a beam search decoding strategy based on word-level and ngram-level reward function to constrain and refine Seq2Seq inference at test time. Results sh…
Transformers can interpolate finite input sequences exactly.
The paper tackles pure exploration in multi-armed bandits with low rank structure using oblivious sampling.
Study optimizes portfolio liquidation strategies with complex market impacts.
Study compares deep learning stock trading strategies in adverse market conditions.
We present and analyze several strategies for improving the performance of stochastic variance-reduced gradient (SVRG) methods. We first show that the convergence rate of these methods can be preserved under a decreasing sequence of errors in the control variate, and use this to derive variants of SVRG that use growing…