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

2579 · May 202519922001200920172026
48 results for elicitability

This paper develops a new method for eliciting more flexible metrics, improving fairness and applicability.

problem Limited flexibility in existing metric elicitation strategies for reflecting user preferences.
method Develops a strategy for eliciting quadratic metrics based on predictive rates, requiring only relative preference feedback.
result Achieves near-optimal query complexity and broadens the use cases for metric elicitation.

A property, or statistical functional, is said to be elicitable if it minimizes expected loss for some loss function. The study of which properties are elicitable sheds light on the capabilities and limitations of point estimation and empirical risk minimization. While recent work asks which properties are elicitable, …

2015-06-23abs ↗pdf ↗

Proposes a method to select fair performance metrics through metric elicitation.

problem Choosing fair performance metrics in multiclass classification with multiple sensitive groups.
method Metric elicitation strategy that requires only relative preference feedback and is robust to noise.
result Elicits group-fair performance metrics for multiclass classification problems.

We discuss equivalent axiomatic characterizations of distortion risk measures, and give a novel and concise proof of the characterization of elicitable distortion risk measures. Elicitability has recently been discussed as a desirable criterion for risk measures, motivated by statistical considerations of forecasting. …

2014-05-15abs ↗pdf ↗

Robustifies elicitable functionals to handle small distribution misspecifications.

problem Determining uniquely optimal forecasts under distributional misspecification.
method Integrates statistical robustness into elicitable functionals using Kullback-Leibler divergence.
result Robust elicitable functionals admit unique solutions at the boundary of uncertainty regions.

A statistical functional, such as the mean or the median, is called elicitable if there is a scoring function or loss function such that the correct forecast of the functional is the unique minimizer of the expected score. Such scoring functions are called strictly consistent for the functional. The elicitability of a …

2015-03-27abs ↗pdf ↗

It is important to collect credible training samples (x,y)(x,y) for building data-intensive learning systems (e.g., a deep learning system). Asking people to report complex distribution p(x)p(x), though theoretically viable, is challenging in practice. This is primarily due to the cognitive loads required for human agents t…

2019-10-08abs ↗pdf ↗

A method for eliciting expert beliefs using preferential questions and normalizing flows.

problem Eliciting high-dimensional probability distributions from noisy judgments.
method Normalizing flows based on preferential questions with a novel functional prior.
result The method allows for the inference of arbitrarily flexible densities from preferential judgments.

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 ↗

The paper analyzes elicitability of return risk measures and their scoring functions.

problem Elicitability of return risk measures and their scoring functions.
method Dual representation results for convex and geometrically convex return risk measures, axiomatic characterizations of Orlicz premia, and construction of strictly consistent scoring functions.
result Orlicz premia are the only elicitable return risk measures under different sets of conditions.

Proposes method for eliciting non-parametric joint priors using normalizing flows.

problem Learning complex non-parametric joint priors for model parameters.
method Expert elicitation combined with normalizing flows for generative modeling.
result Framework supports elicitation of both parametric and non-parametric priors.

The risk of a financial position is usually summarized by a risk measure. As this risk measure has to be estimated from historical data, it is important to be able to verify and compare competing estimation procedures. In statistical decision theory, risk measures for which such verification and comparison is possible,…

2013-03-07abs ↗pdf ↗

Develops a simulation-based method to translate expert knowledge into prior distributions for Bayesian models.

problem Effective incorporation of expert knowledge into prior distributions for diverse model structures.
method Simulation-based stochastic gradient descent to learn hyperparameters of parametric priors from expert knowledge.
result Method is adaptable to various elicitation techniques and independent of model structure.

We consider settings in which the right notion of fairness is not captured by simple mathematical definitions (such as equality of error rates across groups), but might be more complex and nuanced and thus require elicitation from individual or collective stakeholders. We introduce a framework in which pairs of individ…

2019-05-25abs ↗pdf ↗

New algorithm achieves faster multicalibration in online settings.

problem Achieving fair predictions in online settings with limited interaction.
method Generalized multicalibration to arbitrary bounded hypothesis classes and introduced swap multicalibration. Proposed an oracle-efficient algorithm achieving faster multicalibration error.
result Oracle-efficient algorithm achieves T1/(r+1)T^{1/(r+1)} r\ell_r-swap multicalibration error with high probability, improving on previous bounds.

Framework uses IRL and RL to elicit and optimize risk preferences robustly to noise.

problem Eliciting and optimizing risk preferences in noisy environments.
method Adaptive Bayesian IRL for elicitation, model-free RL for optimization, using quantile networks.
result Framework achieves convergence rate of O(exp(cm+O(mlogm)))O(\exp(-cm+O(\sqrt{m\log m}))).

We propose a cost-effective framework for preference elicitation and aggregation under the Plackett-Luce model with features. Given a budget, our framework iteratively computes the most cost-effective elicitation questions in order to help the agents make a better group decision. We illustrate the viability of the fram…

2018-05-14abs ↗pdf ↗

Paper proposes incentives for federated learning to ensure truthful contributions.

problem Ensuring truthful contributions from decentralized users in federated learning.
method Introduces a scoring rule based framework to incentivize truthful reporting of local hypotheses at a Bayesian Nash Equilibrium.
result Proposed solution verified using MNIST and CIFAR-10 datasets, showing decreasing scores for low-quality hypotheses.

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.

Requirements elicitation can be very challenging in projects that require deep domain knowledge about the system at hand. As analysts have the full control over the elicitation process, their lack of knowledge about the system under study inhibits them from asking related questions and reduces the accuracy of requireme…

2018-07-10abs ↗pdf ↗

Study uses property elicitation to understand how fairness regularizers affect optimal decisions.

problem Understanding how fairness regularizers change the optimal decision in predictive algorithms.
method Property elicitation to analyze the relationship between loss, regularization, and optimal decision.
result Necessary and sufficient condition for when a property changes with the addition of a regularizer.

PPT optimizes transformer behavior by steering its latent posterior using prior samples.

problem Eliciting desired behavior from transformers without backpropagation.
method Posterior Prefix Tuning (PPT) uses predictive Monte Carlo (PMC) samples and importance sampling to optimize the latent posterior.
result PPT optimizes transformer behavior without backpropagation, achieving high utility across different utility functions.

In this paper we propose an approach to preference elicitation that is suitable to large configuration spaces beyond the reach of existing state-of-the-art approaches. Our setwise max-margin method can be viewed as a generalization of max-margin learning to sets, and can produce a set of "diverse" items that can be use…

2016-04-20abs ↗pdf ↗

Platform uses queries to elicit investor preferences for portfolio trades, improving allocation efficiency.

problem Hidden-information problem in institutional crossing markets where investors value trades as portfolios but liquidity discovery is organized by individual securities.
method Modeling portfolio crossing as preference elicitation, using price-directed demand queries and value queries to verify selected packages.
result Hybrid procedure using demand and value queries recovers 88-95% of full-information welfare with a limited query budget.

ContextBench benchmarks methods for generating linguistically fluent inputs that activate specific latent features in language models.

problem Identifying inputs that trigger specific behaviours or latent features in language models.
method Context modification and benchmarking methods like Evolutionary Prompt Optimisation (EPO) with LLM-assistance and diffusion model inpainting.
result Enhanced methods achieve state-of-the-art performance in balancing elicitation effectiveness and fluency.

Paper shows similarity learning can lead to strong binary classification performance.

problem How similarity learning can lead to good classification performance.
method Product-type formulation of similarity learning is connected to binary classification through an excess risk bound.
result Similarity learning can directly elicit a decision boundary for binary classification.

This paper explores how to choose scoring rules for estimating properties with parametric assumptions.

problem Indirect elicitation of properties with parametric assumptions.
method Developed a framework for choosing proper scoring rules for indirect elicitation, considering constraints and optimal solutions.
result The optimal estimation of the target property changes monotonically with the increase of each weight, and often setting some weights as zero yields the best configuration.

Study shows LLM-advisors match human performance in eliciting preferences but struggle with conflicting needs and trust.

problem How do LLM-advisors perform in complex financial domains where domain expertise is crucial?
method Lab-based user study with 64 participants, focusing on three challenges: preference elicitation, personalized guidance, and relationship building.
result LLM-advisors can match human performance in preference elicitation but struggle with conflicting needs and trust issues.

Bayesian method helps decision-makers find preferred solutions in multi-objective optimization.

problem Identifying preferred solutions from the Pareto set in multi-objective optimization problems.
method Bayesian model to estimate decision-maker's utility function based on pairwise comparisons, guided by a principled elicitation strategy.
result Superior performance in finding high-utility solutions with a small number of queries.

In the present contribution we characterize law determined convex risk measures that have convex level sets at the level of distributions. By relaxing the assumptions in Weber (2006), we show that these risk measures can be identified with a class of generalized shortfall risk measures. As a direct consequence, we are …

2014-11-03abs ↗pdf ↗