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

Trend · papers per month

2.5%5.0%7.5%10.0% · May 202419922001200920172026
48 results for linear-fractional utility

The paper proposes methods to directly optimize complex classification metrics.

problem Handling class-imbalanced cases with non-decomposable metrics.
method Calibrated surrogate maximization of linear-fractional utility.
result Calibrated surrogate maximization can coincide with true utility maximization under certain conditions.

Method predicts LFSM increments from past observations using codifference.

problem Forecasting LFSM increments from discrete-time observations.
method Uses codifference for serial dependence, with conditional expectation or projection for α>1α>1 or α<2α<2.
result Method shows promising performance in forecasting volatilities, capturing kurtosis and serial dependence.

A method for finding most influential sets reduces a complex problem to a sequence of simpler top-kk problems.

problem Identifying most influential subsets in complex models.
method Reduces the problem to a sequence of top-kk problems using Dinkelbach's method.
result The method returns a globally optimal set for the univariate ratio objective, including partial linear models.

New classifiers ensure fairness by adjusting a base classifier's operating characteristics.

problem Ensuring fairness in binary classification with multiple group constraints.
method Intervening directly on a base classifier's operating characteristics using group-wise ROC convex hulls and post-processing.
result Methods satisfy multiple fairness constraints (DP, EO, PP) with minimal interventions and near-oracle accuracy.

New framework for fair classification in adversarial settings with provable guarantees.

problem Fairness in classification with adversarial perturbations of protected attributes.
method Optimization framework for learning fair classifiers with provable guarantees.
result Near-tightness of accuracy and fairness guarantees for multiple protected attributes and various hypothesis classes.

Deep learning improves Hurst parameter estimation for fractional processes.

problem Estimating the Hurst parameter in fractional stochastic processes.
method Training Long Short-Term Memory (LSTM) networks on extensive datasets of fBm, fOU, and lfsm processes.
result LSTM outperforms traditional methods in fBm and fOU processes but has limited accuracy on lfsm.

For each n>0n > 0 there is a one complex parameter family of homeomorphisms of the circle consisting of linear fractional transformations `conjugated by zznz \to z^n'. We show that these families are free of relations, which determines the structure of `the group of homeomorphisms of finite type'. We also discuss a numbe…

2014-08-23abs ↗pdf ↗

Develops algorithms for optimizing multi-label metrics with provable guarantees.

problem Optimizing complex multi-label metrics like F-measure and Jaccard index.
method Principled learning algorithms based on H-consistency for generalized metrics.
result Provable HH-consistency bounds for multi-label metric optimization.

Continuous time random walks impose a random waiting time before each particle jump. Scaling limits of heavy tailed continuous time random walks are governed by fractional evolution equations. Space-fractional derivatives describe heavy tailed jumps, and the time-fractional version codes heavy tailed waiting times. Thi…

2008-09-09abs ↗pdf ↗

We construct a local action of the group of rational maps from S2S^2 to GL(n,C)GL(n,C) on local solutions of flows of the ZS-AKNS sl(n,C)sl(n,C)-hierarchy. We show that the actions of simple elements (linear fractional transformations) give local Bäcklund transformations, and we derive a permutability formula from different fact…

1998-05-18abs ↗pdf ↗

Given a binary prediction problem, which performance metric should the classifier optimize? We address this question by formalizing the problem of Metric Elicitation. The goal of metric elicitation is to discover the performance metric of a practitioner, which reflects her innate rewards (costs) for correct (incorrect)…

2018-06-05abs ↗pdf ↗

We study time-like surfaces in the three-dimensional Minkowski space with diagonalizable second fundamental form. On any time-like W-surface we introduce locally natural principal parameters and prove that such a surface is determined uniquely (up to motion) by a special invariant function, which satisfies a natural no…

2011-05-18abs ↗pdf ↗

H. Sato introduced a Schwarzian derivative of a contactomorphism of three-dimensional Euclidean space and with T. Ozawa described its basic properties. In this note their construction is extended to all odd dimensions and to non-flat contact projective structures. The contact projective Schwarzian derivative of a conta…

2004-05-19abs ↗pdf ↗

Framework for fair classification with noisy protected attributes and provable guarantees.

problem Fair classification with noisy protected attributes.
method Optimization framework for linear and linear-fractional fairness constraints, handling multiple non-binary attributes.
result Provably fair classifier with minimal accuracy loss, even with large noise.

The only finite nonabelian simple group acting on a homology 3-sphere - necessarily non-freely - is the dodecahedral group A5PSL(2,5)\Bbb A_5 \cong {\rm PSL}(2,5) (in analogy, the only finite perfect group acting freely on a homology 3-sphere is the binary dodecahedral group A5SL(2,5)\Bbb A_5^* \cong {\rm SL}(2,5)). In the present pa…

2005-07-08abs ↗pdf ↗

We show that the only finite nonabelian simple groups which admit a locally linear, homologically trivial action on a closed simply connected 4-manifold MM (or on a 4-manifold with trivial first homology) are the alternating groups A5A_5, A6A_6 and the linear fractional group PSL(2,7) (we note that for homologically n…

2008-03-31abs ↗pdf ↗

Solves steering problem with continuous time, Hilbert-Schmidt cost, and matrix ODEs.

problem Fixed horizon linear quadratic covariance steering in continuous time with a specific terminal cost.
method Formulates necessary conditions as a coupled matrix ODE two-point boundary value problem, designs a matricial recursive algorithm, and proves convergence.
result Proposes and proves the convergence of a matricial recursive algorithm for solving the steering problem.

A framework integrates machine learning with robust control for safer, more reliable systems.

problem Combining machine learning with robust control for systems with stringent safety and reliability requirements.
method Integrates Gaussian Process Regression and state-of-the-art robust controller synthesis within a framework that provides rigorous guarantees.
result Demonstrated improved performance with more data while maintaining rigorous guarantees.

The study connects fairness constraints with optimal transport to derive new insights in classification.

problem Ensuring fairness in classification models without sacrificing performance.
method Using Wasserstein barycenters and optimal transport, the study characterizes optimal classification functions under fairness constraints.
result Maximizing fairness under demographic parity is equivalent to solving a regression problem.

Let FF be a countable family of rational functions of two variables with real coefficients. Each rational function fFf\in F can be thought as a continuous function f:dom(f)Rˉf:dom(f)\to\bar R taking values in the projective line Rˉ=R{}\bar R=R\cup\{\infty\} and defined on a cofinite subset dom(f)dom(f) of the torus Rˉ2\bar R^2. Then t…

2011-08-10abs ↗pdf ↗

Proposes a method to classify binary data from multiple unlabeled datasets.

problem High annotation costs in training classifiers from weakly supervised data.
method Introduces surrogate set classification (SSC) to predict data origin from multiple unlabeled datasets, then uses this to train a binary classifier.
result Demonstrates superior performance compared to existing methods.

Study financial contagion and risk in sparse networks with directed edges.

problem Analyzing systemic risk in sparse financial networks with balance-sheet interactions.
method Linear fraction of institutions with zero out-degree, sender-truncated subgraph G_sh, adversarial and random systemic events, explicit fan-in accumulation bound.
result Maximal forward reachability in G_sh is O(log n) with high probability in the subcritical regime, and multi-hit defaults are negligible in the supercritical regime.

Unified surrogate loss framework for multi-label learning with strong consistency guarantees.

problem Improving consistency and accounting for label correlations in multi-label learning.
method Introducing multi-label logistic loss and extending it to comprehensive multi-label comp-sum losses, proving strong consistency guarantees for any multi-label loss.
result Unified surrogate loss framework benefiting from strong consistency guarantees for any multi-label loss.

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.

Optimizes portfolios with utility theory, diversification, and leverage.

problem Finding optimal portfolio allocation strategies.
method Utility theory, exponential and logarithmic utilities, compound probability distributions, maximum expected utility, generalized mean-variance.
result Enhanced portfolio allocation strategies with natural explanations.

New algorithm tackles unknown utility network resource allocation.

problem Maximizing network utility with unknown agent utilities.
method Modeling as a bandit problem, proposing algorithms for resource allocation.
result Proposed algorithms are optimal when all agents have the same utility.

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 ↗

Study adds investment gains and losses to recursive utility model, proving existence and uniqueness of utility process.

problem Existence and uniqueness of utility process in a recursive utility model with investment gains and losses.
method Generalized recursive utility model with constant elasticity of intertemporal substitution and relative risk aversion degree. Proved existence and uniqueness in a specific, finite-state Markovian setting.
result Utility process exists and is unique when agent derives nonnegative gain-loss utility, and non-existent or non-unique otherwise.

Novel framework for portfolio selection considering utility and risk.

problem Maximizing utility subject to risk constraints with various utility and risk functionals.
method General framework accommodating non-concave utilities and non-convex risk measures. Characterization of well-posedness using a simple either-or criterion.
result Minimal condition for well-posedness: either utility or risk must be sensitive to large losses.

Closed-form optimal portfolios for exponential utility in small/large markets.

problem Optimal portfolios maximizing exponential utility in small/large financial markets.
method Closed-form expressions for optimal portfolios in small markets, convergence to large market optimal utility, numerical procedure for general utility functions.
result Optimal utility in large markets converges to optimal utility in small markets, requiring infinite diversification.

The purpose of this paper relies on the study of long term yield curves modeling. Inspired by the economic litterature, it provides a financial interpretation of the Ramsey rule that links discount rate and marginal utility of aggregate optimal consumption. For such a long maturity modelization, the possibility of adju…

2014-04-07abs ↗pdf ↗

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.

This paper solves a coinsurance problem using fuzzy numbers and expected utility operators.

problem Formulating a coinsurance problem in the possibilistic setting of expected utility operators.
method Developed a framework using expected utility operators to model risk aversion and solve the coinsurance problem.
result Various formulas for the optimal TT-coinsurance rate are derived for specific utility functions and fuzzy numbers.