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

50100149199 · May 202619922001200920172026
48 results for truthful mechanism

A new mechanism reduces expert belief regret in online forecasting.

problem Minimizing expert belief regret in strategic forecasting.
method Developed a no-regret mechanism for non-myopic experts using online I-ELF.
result Achieved ildeO(TN) ilde{O}(\sqrt{T N}) regret for full-information setting.

Optimal securities lending mechanism incentivizes truthfulness and privacy.

problem Maximizing resource usage in securities lending while ensuring truthful reporting and privacy.
method Bayesian optimal algorithm adapted for differential privacy, combined with market equilibrium dynamics.
result An algorithm that is simultaneously private, approximately optimal, and approximately dominant-strategy truthful.

Proposes a new imputation method using autoencoders and feedback mechanisms.

problem Missing data undermines the performance of downstream data products.
method Multiple Imputation with Denoising Autoencoders and Metamorphic Truth/Imputation Feedback.
result Outperforms other methods in various missingness mechanisms and data patterns.

Mechanism designs for unknown agent values in stochastic bandit settings.

problem Designing truthful mechanisms for maximizing social welfare in settings with unknown agent values and stochastic feedback.
method Developed a VCG-like mechanism with regret bounds for multi-round allocations, balancing agent and seller welfare.
result Achieved an $Ω(T^{ rac{2}{3}})$ lower bound for the maximum of welfare, agent utilities, and mechanism utility after TT rounds.

New model for recovering unverifiable signals from observers in decentralized networks.

problem Verifying the level of service provided by untrusted parties in decentralized networks.
method Formal model of signal elicitation, source identifiability condition, and peer prediction techniques.
result Existence of a strictly truthful mechanism for unverifiable signal recovery.

Some online advertising offers pay only when an ad elicits a response. Randomness and uncertainty about response rates make showing those ads a risky investment for online publishers. Like financial investors, publishers can use portfolio allocation over multiple advertising offers to pursue revenue while controlling r…

2015-06-05abs ↗pdf ↗

Improved εε-greedy handles strategic bidding in PPC auctions.

problem Strategic bidding in PPC auctions with personalization and corruptions.
method Extended εε-greedy to handle strategic arms in contextual multi-arm bandit.
result εε-greedy is robust to adversarial corruptions and degrades linearly with corruption.

We consider the problem of fitting a linear model to data held by individuals who are concerned about their privacy. Incentivizing most players to truthfully report their data to the analyst constrains our design to mechanisms that provide a privacy guarantee to the participants; we use differential privacy to model in…

2015-06-10abs ↗pdf ↗

Paper proposes government indemnification for AI risks to solve judgment-proof problem.

problem Uninsurable risks from AI, especially existential risks, create a judgment-proof problem.
method A government-provided, mandatory indemnification program using risk-priced fees and Bayesian Truth Serum.
result The approach better leverages private information and signals risk mitigation efforts.

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 ↗

Ideal attribution mechanisms track model interactions for faithful watermarks.

problem Ensuring models provide transparent and fair attribution decisions.
method Introducing ideal attribution mechanisms and a ledger for tracking model interactions.
result A unified framework for evaluating watermarking schemes, clarifying attainable guarantees.

Algorithm learns optimal dynamic mechanisms from data.

problem Designing optimal mechanisms for dynamic settings with unknown reward functions.
method Offline reinforcement learning with pessimism principle.
result Learned mechanisms are efficient, individually rational, and truthful.

Extends PoS proof-of-stake transaction fee mechanism with miner utility model.

problem Designing a transaction fee mechanism for PoS protocol that incorporates miner utility.
method Introduced a new mechanism (BSP(θ)) incorporating a parameter θ to ensure user and miner incentives.
result The new mechanism (BSP(θ)) satisfies user and miner incentives and contract proofness.

New truthful calibration errors improve model ranking in multiclass prediction.

problem Non-truthful calibration errors can mislead model comparisons.
method Introduced perfectly truthful calibration errors for multiclass predictions.
result Truthful calibration errors preserve decision-theoretic dominance and stabilize model rankings.

In this paper, we propose multi-variable LSTM capable of accurate forecasting and variable importance interpretation for time series with exogenous variables. Current attention mechanism in recurrent neural networks mostly focuses on the temporal aspect of data and falls short of characterizing variable importance. To …

2018-06-17abs ↗pdf ↗

The feasibility of existing data stream algorithms is often hindered by the weakly supervised condition of data streams. A self-evolving deep neural network, namely Parsimonious Network (ParsNet), is proposed as a solution to various weakly-supervised data stream problems. A self-labelling strategy with hedge (SLASH) i…

2019-11-03abs ↗pdf ↗

Paper proves impossible for large language models to control hallucinations without sacrificing other properties.

problem Achieving truthful knowledge representation, semantic information conservation, and knowledge-constrained optimality simultaneously in large language models.
method Modeling inference as an auction of ideas, using mechanism design, proper scoring rules, and transformer architecture analysis.
result No LLM can simultaneously achieve all four essential properties without violating at least one.

APD method decomposes neural network parameters into simple, faithful components.

problem Understanding the internal mechanisms learned by neural networks.
method Attribution-based Parameter Decomposition (APD) method.
result Demonstrated effectiveness in recovering features, separating computations, and identifying representations.

Authentication is a task aiming to confirm the truth between data instances and personal identities. Typical authentication applications include face recognition, person re-identification, authentication based on mobile devices and so on. The recently-emerging data-driven authentication process may encounter undesired …

2019-05-16abs ↗pdf ↗

Recently, several new pari-mutuel mechanisms have been introduced to organize markets for contingent claims. Hanson introduced a market maker derived from the logarithmic scoring rule, and later Chen and Pennock developed a cost function formulation for the market maker. On the other hand, the SCPM model of Peters et a…

2009-02-14abs ↗pdf ↗

The great success of deep learning shows that its technology contains profound truth, and understanding its internal mechanism not only has important implications for the development of its technology and effective application in various fields, but also provides meaningful insights into the understanding of human brai…

2018-05-22abs ↗pdf ↗

Universally valid ground truth is almost impossible to obtain or would come at a very high cost. For supervised learning without universally valid ground truth, a recommended approach is applying crowdsourcing: Gathering a large data set annotated by multiple individuals of varying possibly expertise levels and inferri…

2018-07-31abs ↗pdf ↗

Paper proposes a method to recover accurate labels from partially valid data in multi-label learning.

problem Tackles noisy supervision in multi-label learning with partially valid labels.
method Develops a two-stage method that estimates label enrichment and ground-truth confidences.
result Demonstrates improved performance over state-of-the-art PML methods.

New findings on identifying latent variables in nonlinear ICA models.

problem Identifying latent variables in nonlinear ICA models is challenging due to spurious solutions.
method Proved that conformal maps are identifiable and provided theoretical results on preventing spurious solutions.
result Conformal maps are identifiable in nonlinear ICA models, preventing spurious solutions.

New algorithm reduces regret in strategic prediction problem.

problem Designing an IC algorithm with sublinear regret for strategic experts.
method Developed a new algorithm WSU-UX and proved a worst-case regret bound.
result WSU-UX suffers a Ω(T2/3)Ω(T^{2/3}) lower bound on regret.

Study allocates resources to strategic agents while balancing cost and incentives.

problem Dynamic allocation of reusable resources to strategic agents with private valuations under long-term cost constraints.
method Incentive-aware framework combining epoch-based lazy updates and randomized exploration rounds.
result Achieves ildeO(T) ilde{\mathcal{O}}(\sqrt{T}) social welfare regret, satisfies all cost constraints, and ensures incentive alignment.

GTDL methods fail to accurately model feature interactions in tabular data.

problem Accurate modeling of feature interactions in tabular data.
method Graph-based tabular deep learning methods using attention mechanisms and message-passing schemes.
result Current GTDL methods fail to recover meaningful feature interactions due to poor edge recovery.

RealCause provides a realistic benchmark for causal inference.

problem Lack of a reliable benchmark for comparing causal effect estimators.
method Flexible generative models to create a benchmark that is both ground-truth and realistic.
result Evaluation of over 1500 causal estimators provides evidence for choosing hyperparameters using predictive metrics.

Recently developed deep-learning-based denoisers often outperform state-of-the-art conventional denoisers such as the BM3D. They are typically trained to minimize the mean squared error (MSE) between the output image of a deep neural network (DNN) and a ground truth image. Thus, it is important for deep-learning-based …

2018-03-04abs ↗pdf ↗

New results show contrastive learning can recover shared factors in multimodal data.

problem Understanding when contrastive learning can recover shared latent factors in multimodal data.
method New identifiability results for multimodal contrastive learning, distinguishing between multi-view and multimodal settings.
result Contrastive learning can block-identify shared latent factors in multimodal data, even with dependencies.

Estimates classifier errors without ground truth using algebraic geometry.

problem Lack of ground truth in real-world production systems.
method Non-parametric estimation using algebraic geometry to solve the self-assessment problem.
result Accuracy estimators are better than one part in a hundred.

The paper provides stability guarantees for non-parametric maximum likelihood estimation using statistical mechanics.

problem Non-parametric maximum likelihood estimation and Gaussian mixture models.
method Statistical mechanics analysis to establish stability guarantees for NPMLE.
result High probability upper bounds on the Kullback-Leibler divergence between NPMLE estimators and the true density.