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,695 papers · 148 categories

Trend · papers per month

238477715953 · Jun 202019922001200920172026
48 results for scaled utility functions

Introduces new performance measures using scaled utility functions.

problem Performance measurement in financial contexts.
method Certainty equivalents defined via scaled utility functions, well-posed portfolio optimization problem under generic conditions.
result Link between portfolio dynamics, benchmark process, and utility function choice in the long-run setting.

Investment strategies for rank-dependent utility agents are derived in a continuous-time market.

problem Time inconsistency in rank-dependent utility models.
method Study of consistent planners seeking intra-personal equilibrium strategies.
result Explicit final wealth profile replicating equilibrium strategies, with scaling function derived.

New insights into risk aversion for complex decision models.

problem Understanding risk aversion in non-monotone decision models.
method Characterization of probabilistic risk aversion for generalized rank-dependent functions.
result Probabilistic risk aversion is determined by the distortion function, which is convex or scaled quantile-spread mixtures.

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.

Study scaling limits of utility indifference prices in discretized Bachelier model.

problem Analyzing utility indifference prices for path-dependent European options in a discretized Bachelier model.
method Purely probabilistic approach, including duality argument, optimal drift control problem, martingale techniques, and strong invariance principles.
result Obtained a scaling limit for utility indifference prices as the number of trading times increases.

Study utility indifference pricing with delayed investment information in a Bachelier model.

problem Investment decisions based on delayed information in a Bachelier model.
method Developed discrete-time duality and used techniques from [7] to compute scaling limits.
result Utility indifference prices scaling limit for vanishing delay with quadratic penalty.

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.

Study on utility maximization with Tsallis entropy in reinforcement learning.

problem Exploring utility maximization with Tsallis entropy in reinforcement learning.
method Introducing Tsallis entropy regularizer to induce exploration, investigating specific examples, characterizing well-posedness, designing reinforcement learning algorithm.
result Characterized well-posedness and provided semi-closed-form solutions for specific examples, found distinct optimal strategies.

Differentially private log-location-scale regression models improve privacy in statistical analysis.

problem Ensuring privacy in statistical regression models while maintaining accuracy.
method Integrates differential privacy into LLS regression using the functional mechanism.
result Proposed DP-LLS models satisfy ε-differential privacy and perform well under various conditions.

New learning rates derived for Tikhonov-regularized problems without kernel assumptions.

problem Learning rates for Tikhonov-regularized learning problems.
method Minimax adaptive rates derived using Fourier isocapacitary condition and interpolation theory.
result Derivation of minimax adaptive rates without requiring kernel assumptions.

We use the Minority Game as a testing frame for the problem of the emergence of diversity in socio-economic systems. For the MG with heterogeneous impacts, we show that the direct generalization of the usual agents' profit does not fit some real-world situations. As a typical example we use the traffic formulation of t…

2014-01-17abs ↗pdf ↗

Efficiently solves large-scale robust portfolio optimization problems.

problem High computational demands in large-scale robust portfolio optimization.
method Extended supporting hyperplane approximation for distributionally robust portfolio problems.
result Significantly reduces computational time from several thousand seconds to just a few.

The paper analyzes Tikhonov regularization in Hilbert scales for statistical inverse problems.

problem Statistical inverse problems in Hilbert scales with general noise.
method Tikhonov regularization scheme with conditional stability estimates and high probability error bounds.
result Explicit rates of convergence for oversmoothing and regular cases over defined regularity classes.

DET unifies geometric and functional alignment for high-dimensional scientific data.

problem Challenges in nonrigid registration for high-dimensional, irregular data.
method Domain Elastic Transform (DET) treats data as functions on irregular domains, using a Bayesian framework for elastic motion registration.
result DET achieves 92% topological preservation on MERFISH data and successfully registers whole-embryo Stereo-seq atlases.

Framework for online resource allocation using social welfare functions.

problem Optimal allocation of resources over time steps in a population.
method Confidence sequence framework for SWF-based online learning and inference, valid for any monotonic, concave, and Lipschitz-continuous SWF.
result Achieves near-optimal regret of ildeO(n+nkT) ilde{O}(n+\sqrt{nkT}) for SWF-agnostic algorithm SWF-UCB.

Study utility indifference pricing in a Bachelier model with small linear price impact.

problem Utility indifference pricing in a model with linear price impact.
method Analyzes the Bachelier model with exponential utility indifference prices for vanilla European options.
result Computes the scaling limit of utility indifference prices for a vanishing price impact inversely proportional to risk aversion.

New method calibrates noise for attack risk, improving ML model accuracy.

problem Improving accuracy of privacy-preserving ML models while maintaining privacy.
method Directly calibrates noise scale to a desired attack risk level, bypassing the standard ε\varepsilon-calibration.
result Significantly decreases noise scale, leading to increased utility at the same risk level.

New method for fair resource allocation in AI-aware networks with unknown utility functions.

problem Fair resource allocation in AI-aware communication networks with unknown utility functions.
method Distributed, data-driven bilevel optimization approach to learn surrogate utility functions.
result The proposed algorithm learns from data to autotune surrogate utility functions for unknown utility functions.

We develop a scale-invariant truncated Lévy (STL) process to describe physical systems characterized by correlated stochastic variables. The STL process exhibits Lévy stability for the probability density, and hence shows scaling properties (as observed in empirical data); it has the advantage that all moments are fini…

1999-06-25abs ↗pdf ↗

Proposes a text perturbation method using a Mahalanobis metric to balance privacy and utility.

problem Low utility of text analysis when using spherical noise for privacy-preserving text embedding.
method Regularized Mahalanobis metric to add elliptical noise, accounting for embedding space density.
result Improves privacy statistics while maintaining utility, outperforming Laplace mechanism.

The sheer scale of modern datasets has resulted in a dire need for summarization techniques that identify representative elements in a dataset. Fortunately, the vast majority of data summarization tasks satisfy an intuitive diminishing returns condition known as submodularity, which allows us to find nearly-optimal sol…

2018-06-07abs ↗pdf ↗

Hashing has been widely used for large-scale approximate nearest neighbor search because of its storage and search efficiency. Recent work has found that deep supervised hashing can significantly outperform non-deep supervised hashing in many applications. However, most existing deep supervised hashing methods adopt a …

2017-07-26abs ↗pdf ↗

Study on statistical inference for nonlinear stochastic approximation with Markovian data.

problem Statistical inference for nonlinear stochastic approximation algorithms with Markovian data.
method Established a functional central limit theorem for the partial-sum process of the target parameter estimate, providing asymptotic pivotal statistics for constructing confidence intervals.
result Valid and efficient asymptotic inference method for nonlinear stochastic approximation algorithms with Markovian data.

The maximum entropy principle can be used to assign utility values when only partial information is available about the decision maker's preferences. In order to obtain such utility values it is necessary to establish an analogy between probability and utility through the notion of a utility density function. According…

2007-09-05abs ↗pdf ↗

ConvNets improve nonstationary covariance estimation for large-scale spatial data.

problem Estimating nonstationary spatial covariance functions on large scales.
method Convolutional Neural Networks (ConvNets) for subregion identification and selection.
result Enhanced accuracy in parameter estimation using ConvNet-based partitioning.

Investigates conditions for risk or utility functionals to be sensitive to large losses.

problem Conditions for risk or utility functionals to be sensitive to large losses.
method Analyzes sensitivity to large losses for various risk and utility functionals.
result Value at Risk and Expected Shortfall generally fail to be sensitive to large losses, but expected utility functionals and certain adjusted versions are sensitive.

A framework for eliciting utility functions from investor preferences.

problem Hard elicitation of specific utility functions in portfolio selection.
method Preference-fitting method using probability-wealth pairs and PHARA approximation.
result Fitted utility function converges to the optimal one as more data is used.

Develops a Bayesian framework for portfolio choice with a new posterior distribution.

problem Estimation risk in parametric portfolio policies.
method Generalized Bayesian framework with Gibbs posterior, utility maximization, and KNEEDLE algorithm.
result Optimal scaling parameter λλ controls the balance between prior and data.

Generative models enhance BO for large batch optimization.

problem Efficiently sampling solutions in high-dimensional, combinatorial design spaces.
method Train generative models to sample solutions proportional to expected utility.
result Generative models can approximate optimal target distributions under certain conditions.

We introduce deep scale-spaces (DSS), a generalization of convolutional neural networks, exploiting the scale symmetry structure of conventional image recognition tasks. Put plainly, the class of an image is invariant to the scale at which it is viewed. We construct scale equivariant cross-correlations based on a princ…

2019-05-28abs ↗pdf ↗

SVGP KAN integrates sparse variational GP with KANs for scalable probabilistic inference.

problem Lack of probabilistic outputs in standard KANs and cubic scaling of Gaussian Process methods.
method Sparse Variational GP-KAN combines KAN topology with sparse variational inference and permutation-based importance analysis.
result Enables probabilistic KANs to handle larger datasets with linear computational complexity.

This paper studies the trading volumes and wealth distribution of a novel agent-based model of an artificial financial market. In this model, heterogeneous agents, behaving according to the Von Neumann and Morgenstern utility theory, may mutually interact. A Tobin-like tax (TT) on successful investments and a flat tax …

2015-05-20abs ↗pdf ↗

Two major financial market complexities are transaction costs and uncertain volatility, and we analyze their joint impact on the problem of portfolio optimization. When volatility is constant, the transaction costs optimal investment problem has a long history, especially in the use of asymptotic approximations when th…

2014-01-02abs ↗pdf ↗

We model the logarithm of the price (log-price) of a financial asset as a random variable obtained by projecting an operator stable random vector with a scaling index matrix E\underline{\underline{E}} onto a non-random vector. The scaling index E\underline{\underline{E}} models prices of the individual financial asse…

2006-12-22abs ↗pdf ↗

Optimal portfolios are found for a wide range of utility functions under hyperbolic returns.

problem Portfolio optimization under expected utility criterion for large portfolios.
method Analytical expressions for optimal portfolios under hyperbolic return distributions and various utility functions.
result The two-fund separation holds true for a broad class of utility functions.

A new method extends Bayesian optimization to more models and utilities.

problem Extending Bayesian optimization to a broader class of models and utilities.
method Likelihood-free Bayesian Optimization (LFBO) which directly models the acquisition function without separate inference.
result LFBO outperforms state-of-the-art black-box optimization methods on real-world problems.

A key issue in the estimation of energy hedges is the hedgers' attitude towards risk which is encapsulated in the form of the hedgers' utility function. However, the literature typically uses only one form of utility function such as the quadratic when estimating hedges. This paper addresses this issue by estimating an…

2011-03-30abs ↗pdf ↗