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.
A simple formula approximates AUM fees' cumulative costs.
We study optimal investment problems under the framework of cumulative prospect theory (CPT). A CPT investor makes investment decisions in a single-period financial market with transaction costs. The objective is to seek the optimal investment strategy that maximizes the prospect value of the investor's final wealth. W…
In this work we consider adversarial contextual bandits with risk constraints. At each round, nature prepares a context, a cost for each arm, and additionally a risk for each arm. The learner leverages the context to pull an arm and then receives the corresponding cost and risk associated with the pulled arm. In additi…
Study cost-driven state representation learning for control from partial observations.
We consider reinforcement learning (RL) in Markov Decision Processes in which an agent repeatedly interacts with an environment that is modeled by a controlled Markov process. At each time step , it earns a reward, and also incurs a cost-vector consisting of costs. We design model-based RL algorithms that maximi…
We study optimal investment in a financial market having a finite number of assets from a signal processing perspective. We investigate how an investor should distribute capital over these assets and when he should reallocate the distribution of the funds over these assets to maximize the cumulative wealth over any inv…
We propose a novel algebraic framework for treating probability distributions represented by their cumulants such as the mean and covariance matrix. As an example, we consider the unsupervised learning problem of finding the subspace on which several probability distributions agree. Instead of minimizing an objective f…
Study schedules jobs with unknown holding costs to minimize expected cumulative cost.
New method reduces total cost constraints in CBwK to sqrt(T) with fairness application.
This work introduces CAET, an algorithm for cost-aware pairwise pure exploration.
New method tackles safe reinforcement learning from offline data.
Paper analyzes nonconvex bandit problems with improved adaptive methods.
New algorithms for efficient causal interventions with budget constraints and without constraints.
New algorithm reduces regret in linear mixture SSPs without cost bounds.
In this paper, we propose an effective THresholding method based on ORder Statistic, called THORS, to convert an arbitrary scoring-type classifier, which can induce a continuous cumulative distribution function of the score, into a cost-sensitive one. The procedure, uses order statistic to find an optimal threshold for…
Paper uses SciPhyRL for optimizing large institutional portfolios.
We treat a fairly broad class of financial models which includes markets with proportional transaction costs. We consider an investor with cumulative prospect theory preferences and a non-negativity constraint on portfolio wealth. The existence of an optimal strategy is shown in this context in a class of generalized s…
This paper describes an agent-based model of interacting firms, in which interacting firm agents rationally invest capital and labor in order to maximize payoff. Both transactions and production are taken into account in this model. First, the performance of individual firms on a real transaction network was simulated.…
Optimizes resource allocation in a network with random job requests.
In this paper, we investigate cost-aware joint learning and optimization for multi-channel opportunistic spectrum access in a cognitive radio system. We investigate a discrete time model where the time axis is partitioned into frames. Each frame consists of a sensing phase, followed by a transmission phase. During the …
We propose a contextual bandit based model to capture the learning and social welfare goals of a web platform in the presence of myopic users. By using payments to incentivize these agents to explore different items/recommendations, we show how the platform can learn the inherent attributes of items and achieve a subli…
Explicit robust hedging strategies for convex or concave payoffs under a continuous semimartingale model with uncertainty and small transaction costs are constructed. In an asymptotic sense, the upper and lower bounds of the cumulative volatility enable us to super-hedge convex and concave payoffs respectively. The ide…
Conventional multiclass conditional probability estimation methods, such as Fisher's discriminate analysis and logistic regression, often require restrictive distributional model assumption. In this paper, a model-free estimation method is proposed to estimate multiclass conditional probability through a series of cond…
We consider a modification of the dividend maximization problem from ruin theory. Based on a classical risk process we maximize the difference of expected cumulated discounted dividends and total expected discounted additional funding (subject to some proportional transaction costs). For modelling dividends we use the …
ECOD detects outliers without parameters, fast and simple.
Tens of millions of women suffer from infertility worldwide each year. In vitro fertilization (IVF) is the best choice for many such patients. However, IVF is expensive, time-consuming, and both physically and emotionally demanding. The first question that a patient usually asks before the IVF is how likely she will co…
In this work, we investigate the use of three information-theoretic quantities -- entropy, mutual information with the class variable, and a class selectivity measure based on Kullback-Leibler divergence -- to understand and study the behavior of already trained fully-connected feed-forward neural networks. We analyze …
We consider a repeated newsvendor problem where the inventory manager has no prior information about the demand, and can access only censored/sales data. In analogy to multi-armed bandit problems, the manager needs to simultaneously "explore" and "exploit" with her inventory decisions, in order to minimize the cumulati…
New RL approach tackles constrained Markov decision processes.
Improved resource allocation method reduces procurement costs.
In this paper, we propose a cost-aware cascading bandits model, a new variant of multi-armed ban- dits with cascading feedback, by considering the random cost of pulling arms. In each step, the learning agent chooses an ordered list of items and examines them sequentially, until certain stopping condition is satisfied.…
PDCA algorithm learns policies for RL with constraints using a primal-dual approach.
COF algorithm minimizes cost in multi-armed bandits with known costs and reward constraints.
This paper concerns the dual risk model, dual to the risk model for insurance applications, where premiums are surplus-dependent. In such a model premiums are regarded as costs, while claims refer to profits. We calculate the mean of the cumulative discounted dividends paid until ruin, if the barrier strategy is applie…
New method for neural networks to predict histogram data.
A flexible nonparametric online changepoint detection algorithm for high-frequency data.
New algorithm optimizes online network resource allocation with long-term constraints.
Study quantifies how LLMs capture higher-order statistical structure using cumulant expansion.
We introduce a new online learning framework where, at each trial, the learner is required to select a subset of actions from a given known action set. Each action is associated with an energy value, a reward and a cost. The sum of the energies of the actions selected cannot exceed a given energy budget. The goal is to…
The Lax-Hopf formula simplifies the value function of an intertemporal optimization (infinite dimensional) problem associated with a convex transaction-cost function which depends only on the transactions (velocities) of a commodity evolution: it states that the value function is equal to the marginal fonction of a fin…
This paper analyzes OCBA algorithms' convergence rates for DEDS optimization.
The CSA-ES is an Evolution Strategy with Cumulative Step size Adaptation, where the step size is adapted measuring the length of a so-called cumulative path. The cumulative path is a combination of the previous steps realized by the algorithm, where the importance of each step decreases with time. This article studies …
New method optimizes multiple objectives in A/B testing for AI and clinical trials.
Using methods introduced by Scargle in 1978 we derive a cumulative version of the Lomb periodogram that exhibits frequency independent statistics when applied to cumulative noise. We show how this cumulative Lomb periodogram allows us to estimate the significance of log-periodic signatures in the S&P 500 anti-bubble th…
Adaptive robust strategy improves online portfolio selection by managing market trends and costs.
Kernelized cumulants improve statistical analysis in high-dimensional spaces.
Simulation framework assesses ROI of chronic disease adherence and policy timing.
Neural networks can learn from higher-order cumulants efficiently, requiring quadratic samples.