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

Trend · papers per month

96191287382 · Jun 202019922001200920172026
48 results for statistical utility

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.

The paper tackles statistical and computational challenges in learning correlated reward models.

problem The Independence of Irrelevant Alternatives (IIA) assumption collapses human preferences into a universal utility function, leading to coarse approximations.
method The paper investigates the statistical and computational challenges of learning a correlated probit model using best-of-three preference data.
result Best-of-three preference data overcomes the limitations of pairwise preference data, allowing for more fine-grained modeling of human preferences.

This study measures price risk aversion using indirect utility functions in a lab experiment.

problem Measuring risk aversion with uncertain prices in experimental economics.
method Using indirect utility functions and a multiple price list method in a lab experiment.
result Price risk aversion is statistically greater than payoff risk aversion.

Paper establishes utility theory for synthetic data generation.

problem Lack of theoretical understanding in synthetic data utility.
method Statistical learning framework with two utility metrics: generalization and model ranking.
result Theoretical bounds for synthetic data utility metrics ensure comparable generalization and consistent model comparison.

The paper tackles optimal policy learning with asymmetric counterfactual utilities in healthcare decisions.

problem Learning optimal policies from observed data with asymmetric counterfactual utilities.
method The approach involves identifying and minimizing the maximum expected utility loss using statistical decision theory and solving intermediate classification problems.
result One can learn minimax loss decision rules from observed data.

Paper establishes statistical inference for pairwise comparison models.

problem Statistical inference for pairwise comparison models when the number of subjects diverges.
method Identifies Fisher information matrix as a weighted graph Laplacian for asymptotic normality.
result Near-optimal asymptotic normality result for maximum likelihood estimator.

Framework for efficient statistical estimation with privacy guarantees.

problem Statistical estimation problems with differential privacy constraints.
method High-dimensional Propose-Test-Release (HPTR) framework combining exponential mechanism, robust statistics, and resilience.
result Near-optimal utility guarantees and tight local sensitivity bounds for various statistical problems.

We study statistical risk minimization problems under a privacy model in which the data is kept confidential even from the learner. In this local privacy framework, we establish sharp upper and lower bounds on the convergence rates of statistical estimation procedures. As a consequence, we exhibit a precise tradeoff be…

2012-10-07abs ↗pdf ↗

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.

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.

We propose a novel and flexible rank-breaking-then-composite-marginal-likelihood (RBCML) framework for learning random utility models (RUMs), which include the Plackett-Luce model. We characterize conditions for the objective function of RBCML to be strictly log-concave by proving that strict log-concavity is preserved…

2018-06-04abs ↗pdf ↗

This paper presents a new mechanism for producing sanitized statistical summaries that achieve \emph{differential privacy}, called the \emph{K-Norm Gradient} Mechanism, or KNG. This new approach maintains the strong flexibility of the exponential mechanism, while achieving the powerful utility performance of objective …

2019-05-23abs ↗pdf ↗

New private learning algorithms improve utility in tasks with public features.

problem Private learning with public features in recommendation and ad prediction.
method Developed algorithms that protect only certain sufficient statistics, improving utility for linear regression and private recommendation benchmarks.
result Achieved state-of-the-art performance on private recommendation benchmarks.

Tutorials on preference learning with Gaussian Processes.

problem Understanding individual preferences and choices for efficient and personalized applications.
method Presentation of a comprehensive framework for preference learning with Gaussian Processes, incorporating rationality principles.
result Construction of preference learning models that encompass various utility models and scenarios.

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)].

ARF synthesizes epidemiological data to match original findings.

problem Synthetic data quality and privacy in epidemiology.
method Adversarial Random Forests (ARF) for efficient data synthesis.
result ARF-generated synthetic data consistently matches original epidemiological findings.

In statistical physics, the conservation of particle number results in the equalization of the chemical potential throughout a system at equilibrium. In contrast, the homogeneity of utility in socio-economic models is usually thought to rely on the competition between individuals, leading to Nash equilibrium. We show t…

2010-10-15abs ↗pdf ↗

This paper develops a general framework for analyzing asymptotics of VV-statistics. Previous literature on limiting distribution mainly focuses on the cases when nn \to \infty with fixed kernel size kk. Under some regularity conditions, we demonstrate asymptotic normality when kk grows with nn by utilizing existin…

2019-12-02abs ↗pdf ↗

Pipeline parallelism (PP) when training neural networks enables larger models to be partitioned spatially, leading to both lower network communication and overall higher hardware utilization. Unfortunately, to preserve the statistical efficiency of sequential training, existing PP techniques sacrifice hardware efficien…

2019-10-09abs ↗pdf ↗

Improved privacy-preserving statistical estimates with customizable noise reduction.

problem Balancing privacy and accuracy in statistical estimation.
method Introducing the Brownian mechanism, which adds Gaussian noise to a sequence of estimates, gradually reducing it based on the practitioner's needs.
result The Brownian mechanism produces more accurate estimates while maintaining strong privacy guarantees, outperforming existing methods.

In this paper we consider a utility maximization problem with defaultable stocks and looping contagion risk. We assume that the default intensity of one company depends on the stock prices of itself and other companies, and the default of the company induces immediate drops in the stock prices of the surviving companie…

2017-10-14abs ↗pdf ↗

This paper attempts to provide a decision-theoretic foundation for the measurement of economic tail risk, which is not only closely related to utility theory but also relevant to statistical model uncertainty. The main result is that the only risk measures that satisfy a set of economic axioms for the Choquet expected …

2014-01-20abs ↗pdf ↗

Enhances privacy in federated learning with Laplacian smoothing.

problem Protecting data privacy in federated learning while maintaining model accuracy.
method Laplacian smoothing for differentially private federated learning (DP-Fed-LS).
result Improves model accuracy with differential privacy guarantee and membership privacy.

A new method for unlearning trained models without needing the original data.

problem Lack of access to original training data for privacy-preserving unlearning.
method Uses a surrogate dataset to approximate statistical properties and calibrates noise based on statistical distance.
result Effective unlearning of trained models with strong privacy guarantees, even without access to the original data.

A DP method selects best sparse models in high dimensions efficiently.

problem Model selection in high-dimensional sparse linear regression under privacy constraints.
method Differential privacy (DP) with exponential mechanism and Metropolis-Hastings algorithm.
result The method identifies active features quickly under privacy constraints.

This paper improves AI defenses against network attacks using ML and adversarial learning.

problem Protecting personal data from sophisticated network attacks.
method Unified multi-modal dataset, machine learning for detection, adversarial learning for synthetic data generation.
result Stable ML models for intrusion detection and high-fidelity synthetic data.

A new test statistic measures discrepancy between conditional distributions.

problem Measuring the discrepancy between two conditional distributions.
method Proposes a Bregman matrix divergence-based statistic that avoids explicit distribution estimation.
result The new statistic inherits high-order statistics and demonstrates utility in multi-task learning, concept drift detection, and feature selection.

Paper proposes efficient methods for clustering and signal recovery in high-dimensional data with block structures.

problem High-dimensional clustering and signal recovery under block signal structures.
method CFA-PCA and MA-PCA methods for sparse and dense block signals.
result Proposed methods achieve computational minimax optimality for clustering and signal recovery.

Estimates boundaries for acceptable bilateral gamma risk in financial markets.

problem Determining the compensation needed for risky future cash flows to be considered acceptable.
method Statistical inference from market prices and derivatives, using prospect theory.
result Upper and lower boundaries for bilateral gamma risk are estimated and tested against market data.

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.

We introduce a mean-field type approximation for description of company's income statistics. Utilizing huge company data we show that a discrete version of Langevin equation with additive and multiplicative noises can appropriately describe the time evolution of a company's income fluctuation in statistical sense. The …

2003-07-11abs ↗pdf ↗