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.
VIABLE learns a loss function for better few-shot learning.
Causal spacetimes with Ricci tensor have unique transformations.
Classifies cosmological Finsler spacetimes, finding viable non-stationary models.
The study finds that maximizing median returns is the only viable strategy in portfolio selection.
We consider the problem of optimal inside portfolio in a financial market with a corresponding wealth process modelled by \begin{align}\label{eq0.1} \begin{cases} dX(t)&=π(t)X(t)[α(t)dt+β(t)dB(t)]; \quad t\in[0, T] X(0)&=x_0>0, \end{cases} \end{align} where is a Brownian motion. We assum…
Optimized biopharmaceutical seed train design reduces variability and saves time.
Bayesian inference in state-space models is challenging due to high-dimensional state trajectories. A viable approach is particle Markov chain Monte Carlo, combining MCMC and sequential Monte Carlo to form "exact approximations" to otherwise intractable MCMC methods. The performance of the approximation is limited to t…
The paper validates statistical models for groundwater data.
A viable and still unproved conjecture states that, if is a smooth algebraic surface and is a smooth algebraic curve in , then realizes the smallest possible genus amongst all smoothly embedded -manifolds in its homology class. A proof is announced here for this conjecture, for a large class of surfac…
This paper proposes a method to select project schedules with the lowest risk.
Language models trained on chess board states outperform those on moves, even with causal masking.
MaxEnt framework recovers standard model selection procedures and identifies the most generalizable model.
PGEL learns embeddings to diversify protein motifs while maintaining biological function.
Optimizes long-term social welfare in recommender systems by matching users to providers.
We study which geometric structure can be constructed from the vierbein (frame/coframe) variables and which field models can be related to this geometry. The coframe field models, alternative to GR, are known as viable models for gravity, since they have the Schwarzschild solution. Since the local Lorentz invariance is…
A framework for detecting out-of-distribution data in RL using uncertainty-based classification.
UMAP (Uniform Manifold Approximation and Projection) is a novel manifold learning technique for dimension reduction. UMAP is constructed from a theoretical framework based in Riemannian geometry and algebraic topology. The result is a practical scalable algorithm that applies to real world data. The UMAP algorithm is c…
Distributional reinforcement learning (distributional RL) has seen empirical success in complex Markov Decision Processes (MDPs) in the setting of nonlinear function approximation. However, there are many different ways in which one can leverage the distributional approach to reinforcement learning. In this paper, we p…
Thompson sampling has emerged as an effective heuristic for a broad range of online decision problems. In its basic form, the algorithm requires computing and sampling from a posterior distribution over models, which is tractable only for simple special cases. This paper develops ensemble sampling, which aims to approx…
Copies have been proposed as a viable alternative to endow machine learning models with properties and features that adapt them to changing needs. A fundamental step of the copying process is generating an unlabelled set of points to explore the decision behavior of the targeted classifier throughout the input space. I…
In this paper we propose to perform model ensembling in a multiclass or a multilabel learning setting using Wasserstein (W.) barycenters. Optimal transport metrics, such as the Wasserstein distance, allow incorporating semantic side information such as word embeddings. Using W. barycenters to find the consensus between…
New method improves graph representations against adversarial attacks.
Frank-Wolfe algorithms for convex minimization have recently gained considerable attention from the Optimization and Machine Learning communities, as their properties make them a suitable choice in a variety of applications. However, as each iteration requires to optimize a linear model, a clever implementation is cruc…
RL research overhypes potential but lacks deployable solutions.
Proposes a new model for equity options calibration.
Volatility models must be rough to match market skew.
In the present paper, we studied a Dynamic Stochastic Block Model (DSBM) under the assumptions that the connection probabilities, as functions of time, are smooth and that at most nodes can switch their class memberships between two consecutive time points. We estimate the edge probability tensor by a kernel-type p…
Early stopping is a widely used technique to prevent poor generalization performance when training an over-expressive model by means of gradient-based optimization. To find a good point to halt the optimizer, a common practice is to split the dataset into a training and a smaller validation set to obtain an ongoing est…
This paper studies the problem of stance detection which aims to predict the perspective (or stance) of a given document with respect to a given claim. Stance detection is a major component of automated fact checking. As annotating stances in different domains is a tedious and costly task, automatic methods based on ma…
Extreme classification problems are multiclass and multilabel classification problems where the number of outputs is so large that straightforward strategies are neither statistically nor computationally viable. One strategy for dealing with the computational burden is via a tree decomposition of the output space. Whil…
MODWST improves classification tasks with wavelet scattering.
In this paper, reinforcement learning is applied to the problem of optimizing market making. A multi-agent reinforcement learning framework is used to optimally place limit orders that lead to successful trades. The framework consists of two agents. The macro-agent optimizes on making the decision to buy, sell, or hold…
We consider a general class of diffusion-based models and show that, even in the absence of an Equivalent Local Martingale Measure, the financial market may still be viable, in the sense that strong forms of arbitrage are excluded and portfolio optimisation problems can be meaningfully solved. Relying partly on the rec…
In this paper we consider the problem of calculating the quantiles of a risky position, the dynamic of which is described as a continuous time regime-switching jump-diffusion, by using Fourier Transform methods. Furthermore, we study a classical option-based portfolio strategy which minimizes the Value-at-Risk of the h…
New method estimates chirp parameters robustly from noisy mixtures.
When considering answering important questions with data, unsupervised data offers extensive insight opportunity and unique challenges. This study considers student survey data with a specific goal of clustering students into like groups with underlying concept of identifying different poverty levels. Fuzzy logic is co…
Algorithm bounds causal queries under selection bias.
Bayesian online changepoint detection (BOCPD) (Adams & MacKay, 2007) offers a rigorous and viable way to identify changepoints in complex systems. In this work, we introduce a Stein variational online changepoint detection (SVOCD) method to provide a computationally tractable generalization of BOCPD beyond the exponent…
Paper uses LLMs for sector allocation, showing better returns.
Social Security and other public policies can be viewed as a series of cash in and outflows that depend on parameters such as the age distribution of the population and the retirement age. Given forecasts of these parameters, policies can be designed to be financially stable, i.e., to terminate with a zero balance. If …
Improved path integral method for financial derivatives pricing.
Paper presents a new computational technique for finance using ERM and neural networks.
We show how effective-potential path-integrals methods, stemming on a simple and nice idea originally due to Feynman and successfully employed in Physics for a variety of quantum thermodynamics applications, can be used to develop an accurate and easy-to-compute semi-analytical approximation of transition probabilities…
Neuroscientific theory suggests that dopaminergic neurons broadcast global reward prediction errors to large areas of the brain influencing the synaptic plasticity of the neurons in those regions. We build on this theory to propose a multi-agent learning framework with spiking neurons in the generalized linear model (G…
This thesis investigates unsupervised time series representation learning for sequence prediction problems, i.e. generating nice-looking input samples given a previous history, for high dimensional input sequences by decoupling the static input representation from the recurrent sequence representation. We introduce thr…
We view molecular optimization as a graph-to-graph translation problem. The goal is to learn to map from one molecular graph to another with better properties based on an available corpus of paired molecules. Since molecules can be optimized in different ways, there are multiple viable translations for each input graph…
Independent component analysis (ICA), as an approach to the blind source-separation (BSS) problem, has become the de-facto standard in many medical imaging settings. Despite successes and a large ongoing research effort, the limitation of ICA to square linear transformations have not been overcome, so that general INFO…
New model tackles causal bandits with dependent variables.