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

134268402536 · Jun 202019922001200920172026
48 results for utility bounds

The study bounds the utility of empirically optimal portfolios using stock return data.

problem Maximizing expected ratio of portfolio utility to best asset utility.
method High probability utility bounds derived from Lipschitz or Hölder continuous utility functions.
result Utility bounds depend on utility function, number of assets, and observations.

The paper examines utility maximization in markets with hidden Gaussian drift, finding restrictions on model parameters.

problem Utility maximization problems in markets with hidden Gaussian drift mean-reverting processes.
method Derives sufficient conditions for bounded maximum expected utility of terminal wealth for models with full and partial information.
result Restrictions on model parameters for bounded maximum expected utility.

Paper improves privacy and utility of SGD with bounded domain and smooth losses.

problem Lack of tight privacy bounds and practical assumptions in DPSGD.
method Rigorous privacy characterization for DPSGD with general L-smooth and non-convex loss functions, tracking privacy loss over iterations.
result Privacy loss converges without convexity assumption for bounded domain, improving utility.

New algorithm tackles non-linear utility in MNL bandits with ildeO(T) ilde{O}(\sqrt{T}) regret.

problem Sequential assortment selection with intricate user-item interactions.
method Upper Confidence Bound principle for non-linear parametric utility functions, including neural networks.
result Achieves ildeO(T) ilde{O}(\sqrt{T}) regret bound for neural network-based utilities.

BUDS balances privacy and utility by shuffling data, achieving strong privacy with minimal loss.

problem Balancing privacy and utility in crowd-sourced statistical databases.
method One-hot encoding, iterative shuffling, loss estimation, risk minimization.
result Achieves ε=0.02ε= 0.02 for privacy, maintaining a privacy bound of ε=ln[t/((n11)S)]ε= ln [t/((n_1 - 1)^S)].

Using elementary arguments, we show how to derive Lp\mathbf{L}_p-error bounds for the approximation of frictionless wealth process in markets with proportional transaction costs. For utilities with bounded risk aversion, these estimates yield lower bounds for the frictional value function, which pave the way for its as…

2018-02-16abs ↗pdf ↗

In the Bayesian approach to sequential decision making, exact calculation of the (subjective) utility is intractable. This extends to most special cases of interest, such as reinforcement learning problems. While utility bounds are known to exist for this problem, so far none of them were particularly tight. In this pa…

2011-06-18abs ↗pdf ↗

DIFF2 improves differential privacy in nonconvex optimization with better utility bounds.

problem Improving differential privacy in nonconvex optimization with better utility bounds.
method DIFF2 constructs a differential private global gradient estimator using gradient differences.
result DIFF2 achieves a utility of \(\widetilde O(d^{2/3}/(n\varepsilon_{\mathrm{DP}})^{4/3})\), significantly better than \(\widetilde O(\sqrt{d}/(n\varepsilon_{\mathrm{DP}}))\).

We introduce a class of utility-based market makers that always accept orders at their risk-neutral prices. We derive necessary and sufficient conditions for such market makers to have bounded loss. We prove that hyperbolic absolute risk aversion utility market makers are equivalent to weighted pseudospherical scoring …

2012-06-20abs ↗pdf ↗

We give a general formulation of the utility maximization problem under nondominated model uncertainty in discrete time and show that an optimal portfolio exists for any utility function that is bounded from above. In the unbounded case, integrability conditions are needed as nonexistence may arise even if the value fu…

2013-07-13abs ↗pdf ↗

New method generates private synthetic data with optimal utility for smooth queries.

problem Achieving strong utility guarantees for meaningful downstream analysis of sensitive datasets.
method Proposes a polynomial-time algorithm for generating (ε,δ)(\varepsilon,δ)-differentially private synthetic data with minimax optimal error rates for smooth queries.
result Achieves a minimax error rate of Ok,d(nmin{1,kd})O_{k,d}(n^{-\min \{1, \frac{k}{d}\}}) for kk-smooth queries, up to a log(n)\log(n) factor.

Paper formalizes Simon's satisficing through FFSD, proving its equivalence to expected utility theory.

problem Formalizing Herbert Simon's bounded rationality concept in economic decision-making.
method Developed FFSD framework using Lean 4 theorem prover, proving equivalence to expected utility theory.
result Equivalence theorem linking FFSD to expected utility maximization for approximate indicator functions.

Optimal defenses protect FL models from gradient reconstruction attacks.

problem Gradient reconstruction attacks compromise FL models by recovering original data from shared gradients.
method Derive a theoretical lower bound of reconstruction error, customize noise and pruning defenses, and achieve optimal trade-off between leakage and utility.
result Our methods outperform Gradient Noise and Pruning in protecting training data and maintaining model utility.

Estimates and optimizes UBSR risk in recursive settings.

problem Estimating and optimizing UBSR risk in a recursive setting with one-at-a-time samples.
method Casts UBSR as a root finding problem, uses stochastic approximation and gradient descent.
result Derives non-asymptotic bounds on estimation and optimization errors.

Theoretical limits on verifying self-improving systems without risking unbounded utility.

problem Formalizing and proving the limits of safety verification for self-improving systems.
method Developed dual conditions and used Holder's inequality, NP counting method, and Lipschitz bounds to establish impossibility and ceiling results.
result A classifier-based safety gate cannot simultaneously permit unbounded beneficial self-modification and bounded cumulative risk.

Our study analyzes how neural network initialization affects privacy and utility in overparameterized models.

problem Privacy and utility trade-off in overparameterized neural networks.
method Analytical proof of KL divergence privacy bound, focusing on initialization, width, and depth.
result Privacy bound improvement with increasing depth under certain initializations, degradation under others.

Improved sample complexity for identifying best policies in risk-sensitive reinforcement learning.

problem Identifying approximately optimal policies in risk-sensitive reinforcement learning with exponential horizon dependence.
method Forward-model based algorithm with KL-based exploration bonuses adapted for entropic criterion, leveraging smoothness properties of exponential utility and a new stopping rule.
result Achieved sample complexity matching the lower bound, closing the gap between upper and lower bounds.

Develops a framework for optimal investment in assets with different liquidity constraints.

problem Optimal investment-consumption problem for a utility-maximizing investor with lower-bound constraints.
method Generalized martingale approach and decomposition of the problem into subproblems.
result Explicit formulas for optimal strategies derived for power-utility functions.

The problem of robust utility maximization in an incomplete market with volatility uncertainty is considered, in the sense that the volatility of the market is only assumed to lie between two given bounds. The set of all possible models (probability measures) considered here is non-dominated. We propose studying this p…

2012-01-03abs ↗pdf ↗

Improved privacy analysis for stochastic gradient descent.

problem Analyzing privacy leakage in noisy stochastic gradient descent.
method Modeling Rényi divergence dynamics with Langevin diffusions, proving exponential privacy loss convergence for smooth and strongly convex objectives.
result Privacy loss converges exponentially fast for smooth and strongly convex objectives under constant step size.

New learning dynamics achieve fast convergence in games without needing to know utility scales.

problem Fast convergence guarantees in learning games require prior knowledge of utility scales.
method Developed scale-free and scale-invariant learning dynamics using optimistic follow-the-regularized-leader with adaptive learning rates and clipping techniques.
result Achieved fast convergence rates to Nash and correlated equilibria without prior utility scale knowledge.

Intersectional constraints improve selection outcomes by reducing inequality.

problem Persistent inequality and reduced utility in selection processes due to implicit bias.
method Introducing intersectional constraints to mitigate the adverse effects of implicit bias in selection processes.
result Intersectional constraints can recover almost all the utility achievable in the absence of implicit bias, offering a significant advantage over non-intersectional constraints.

Gambles are random variables that model possible changes in monetary wealth. Classic decision theory transforms money into utility through a utility function and defines the value of a gamble as the expectation value of utility changes. Utility functions aim to capture individual psychological characteristics, but thei…

2014-05-03abs ↗pdf ↗

We consider market players with tail-risk-seeking behaviour as exemplified by the S-shaped utility introduced by Kahneman and Tversky. We argue that risk measures such as value at risk (VaR) and expected shortfall (ES) are ineffective in constraining such players. We show that, in many standard market models, product d…

2017-11-01abs ↗pdf ↗

The paper confirms a conjecture about optimal expected utility in markets with insider information.

problem Optimal expected utility in markets with insider information.
method An extension of the Black-Scholes-Merton model with a sequence of discrete-time economies.
result Optimal expected utility converges to the classic model when conditions are met.

Current approaches in approximate inference for Bayesian neural networks minimise the Kullback-Leibler divergence to approximate the true posterior over the weights. However, this approximation is without knowledge of the final application, and therefore cannot guarantee optimal predictions for a given task. To make mo…

2018-05-10abs ↗pdf ↗

Random utility theory models an agent's preferences on alternatives by drawing a real-valued score on each alternative (typically independently) from a parameterized distribution, and then ranking the alternatives according to scores. A special case that has received significant attention is the Plackett-Luce model, fo…

2012-11-11abs ↗pdf ↗

Algorithm identifies best item from subsets with random utility model feedback.

problem PAC learning the best item from subsets with random utility model feedback.
method Pairwise relative counts and hierarchical elimination for learning algorithm.
result Near-optimal PAC sample complexity guarantee for identifying ε-optimal item.

New bounds for private matrix approximation using Gaussian noise and Dyson Brownian Motion.

problem Private approximation of symmetric matrices with Gaussian noise.
method Viewing Gaussian noise as Dyson Brownian Motion to track eigenvalue and eigenvector evolution.
result Improved bounds on Frobenius-distance utility for private matrix approximation.

Subjective expected utility theory assumes that decision-makers possess unlimited computational resources to reason about their choices; however, virtually all decisions in everyday life are made under resource constraints - i.e. decision-makers are bounded in their rationality. Here we experimentally tested the predic…

2016-10-06abs ↗pdf ↗

The study examines Nash equilibria in utility maximization games with multiplicative performance criteria.

problem Existence and uniqueness of Nash equilibria in multiplicative performance criteria games.
method General characterization of Nash equilibria for a large class of utility functions.
result Existence and uniqueness of Nash equilibria for arbitrary initial wealth vectors.