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

1234 · Aug 201819922001200920172026
48 results for Condorcet Paradox

Paper explores limits and possibilities of aligning LLMs with human preferences.

problem Aligning LLMs with diverse human preferences to ensure fairness and informed outcomes.
method Analysis of probabilistic representation of human preferences and preservation of diverse preferences.
result LLMs can't fully align with human preferences using reward-based approaches due to Condorcet cycles, but mixed strategies are statistically possible.

RLHF performs well despite violating social choice theory axioms.

problem RLHF's empirical success contradicts social choice theory axioms.
method Showed RLHF satisfies pairwise majority and Condorcet consistency under mild assumptions, and introduced new alignment criteria.
result RLHF satisfies pairwise majority and Condorcet consistency under mild assumptions, explaining its practical success.

New algorithm reduces dynamic regret in non-stationary dueling bandits using a weighted Borda score.

problem Designing algorithms with low dynamic regret in non-stationary dueling bandits.
method Introducing a novel weighted Borda score framework to analyze the Condorcet problem and establish improved bounds.
result First optimal and adaptive dynamic regret upper bound of ildeO(ildeL1/3K1/3T2/3) ilde{O}( ilde{L}^{1/3} K^{1/3} T^{2/3} ).

This paper tackles combinatorial pure exploration for dueling bandits, aiming to find the best candidate-position match.

problem Finding the best candidate-position match in a dueling bandit setting.
method The paper adapts combinatorial pure exploration for multi-armed bandits to dueling bandits, considering both Borda winner and Condorcet winner cases. It designs PAC and exact algorithms for Borda winner and a fully polynomial time approximation scheme (FPTAS) for Condorcet winner.
result The paper introduces the first algorithm with polynomial running time per round for identifying the Condorcet winner in CPE-DB.

The famous Banach-Tarski paradox claims that the three dimensional rotation group acts on the two dimensional sphere paradoxically. In this paper, we generalize their result to show that the classical group acts on the flag manifold paradoxically.

2011-06-02abs ↗pdf ↗

New algorithm achieves near-optimal performance in dueling bandit problem.

problem Optimizing decision-making in dueling bandit problems with limited adaptive rounds.
method Developed a batched algorithm that matches the asymptotic regret bounds of sequential algorithms under the Condorcet condition.
result Asymptotic regret of O(K2log2(K))+O(Klog(T))O(K^2\log^2(K)) + O(K\log(T)) in O(log(T))O(\log(T)) rounds.

In this paper, we propose a Double Thompson Sampling (D-TS) algorithm for dueling bandit problems. As indicated by its name, D-TS selects both the first and the second candidates according to Thompson Sampling. Specifically, D-TS maintains a posterior distribution for the preference matrix, and chooses the pair of arms…

2016-04-25abs ↗pdf ↗

Karl Menger's 1934 paper on the St. Petersburg paradox contains mathematical errors that invalidate his conclusion that unbounded utility functions, specifically Bernoulli's logarithmic utility, fail to resolve modified versions of the St. Petersburg paradox.

2011-10-07abs ↗pdf ↗

This paper develops a cohomological hierarchy for bistable visual paradoxes.

problem Understanding the hierarchy of visual paradoxes built from bistable elements.
method Develops a cohomological hierarchy using Z2\mathbb{Z}_2 coefficients and a discrete Stokes theorem.
result Reveals a hierarchy of paradox classes from H0H^0 through H2H^2, refined at each degree by the relative/absolute distinction.

Improved algorithm for adaptive dueling bandits with near-optimal regret bound.

problem Non-stationary dueling bandits with unknown number of preference changes.
method Elimination-based rescheduling algorithm for adaptive dynamic regret.
result Near-optimal ildeO(SextttCWT) ilde{O}(\sqrt{S^{ exttt{CW}} T}) dynamic regret bound.

Siegel's paradox is a fundamental question in international finance about exchange rates for futures contracts and has puzzled many scholars for over forty years. The unorthodox approach presented in this article leads to an arbitrage-free solution which is invariant under currency re-denominations and is symmetric, as…

2018-05-09abs ↗pdf ↗

In this article, I will present a paradox whose purpose is to draw your attention to an important topic in finance, concerning the non-independence of the financial returns (non-ergodic hypothesis). In this paradox, we have two people sitting at a table separated by a black sheet so that they cannot see each other and …

2019-03-05abs ↗pdf ↗

The paper explores game-theoretic alignment of LLMs with human preferences, finding limitations and conditions.

problem Aligning LLMs with human preferences using game theory.
method Systematic study of payoff choices in a two-player zero-sum game for desirable alignment properties.
result Impossibility of preference matching in game-theoretic LLM alignment under standard assumptions.

The Allais and Ellsberg paradoxes show that the expected utility hypothesis and Savage's Sure-Thing Principle are violated in real life decisions. The popular explanation in terms of 'ambiguity aversion' is not completely accepted. On the other hand, we have recently introduced a notion of 'contextual risk' to mathemat…

2011-05-09abs ↗pdf ↗

Thompson Sampling shows polynomial regret for combinatorial semi-bandits with subgaussian rewards.

problem Finding optimal solutions in combinatorial semi-bandits with suboptimal sampling.
method Proposes Thompson Sampling with polynomial regret for linear combinatorial semi-bandits.
result Demonstrates 'mismatched sampling paradox' where knowing distributions can lead to worse performance.

Compact models match or exceed GPT's performance in financial news sentiment analysis.

problem Improving financial sentiment analysis models without large computational costs.
method Fine-tuning non-generative, small-sized models (FinBERT, FinDRoBERTa) on a novel market score database.
result Fine-tuned models outperform GPT-3.5 and GPT-4 in zero-shot learning for financial news sentiment analysis.

A resolution of the St. Petersburg paradox is presented. In contrast to the standard resolution, utility is not required. Instead, the time-average performance of the lottery is computed. The final result can be phrased mathematically identically to Daniel Bernoulli's resolution, which uses logarithmic utility, but is …

2010-11-19abs ↗pdf ↗

The paper tackles individualized decision-making under unmeasured confounding, providing a novel minimax solution and a paradox.

problem Unmeasured confounding in causal inference leads to biased estimates and affects individualized decision-making.
method The authors establish a formal link between individualized decision-making under partial identification and classical decision theory, providing a minimax solution and a paradox.
result A novel minimax solution for individualized decision-making/policy assignment is provided, and an interesting paradox is drawn.

A mathematical paradox shows secant planes don't always form a tangent plane, but some analogies hold with a specific vector product.

problem Secant planes of a two-variable smooth function do not always form a tangent plane, even for simple polynomials.
method Analogies with the one-variable case are explored, using Clifford's geometric vector product.
result Some analogies with the one-variable case still hold in the multi-variable context with a specific vector product.

Study on tracking preference shifts in dueling bandits problems.

problem Tracking significant preference shifts in dueling bandits problems.
method Analysis of dueling bandits with distribution shifts, focusing on significant shifts (Suk and Kpotufe, 2022).
result Design of adaptive algorithms with O(KildeLT)O(\sqrt{K ilde{L}T}) dynamic regret for certain preference distribution classes.

Unified framework for best arm identification and dueling bandits regret minimization.

problem Best arm identification and dueling bandits regret minimization.
method Tree-Guided Identify-Then-Exploit (TG-ITE) framework.
result Unified approach achieving optimal sample complexity and regret guarantees.

New methods resolve conflicting treatment effect estimates in health tech assessments.

problem Conflicting conclusions from different sponsors analyzing the same data.
method Arbitrated indirect treatment comparisons (ArMAIC) targeting a common target population.
result Estimates treatment effects in a common target population, resolving the MAIC paradox.

Multi-armed bandit(MAB) problem is a reinforcement learning framework where an agent tries to maximise her profit by proper selection of actions through absolute feedback for each action. The dueling bandits problem is a variation of MAB problem in which an agent chooses a pair of actions and receives relative feedback…

2019-02-07abs ↗pdf ↗

Buying or selling assets leads to transaction costs for the investor. On one hand, it is well know to all market practionaires that the transaction costs are positive on average and present therefore systematic loss. On the other hand, for every trade, there is a buy side and a sell side, the total amount of asset and …

2011-03-11abs ↗pdf ↗

GenAI adoption paradoxically lowers ROE for U.S. banks, with spillovers but systemic risk concerns.

problem Productivity paradox and implementation costs in U.S. banking sector with AI adoption.
method Dynamic Spatial Durbin Models (DSDM) and Synthetic Difference-in-Differences (SDID) for causal inference.
result AI adoption leads to a 428-basis-point decline in ROE for banks, with spillovers but systemic risk implications.

Prior work finds a diversity paradox: diversity breeds innovation, and yet, underrepresented groups that diversify organizations have less successful careers within them. Does the diversity paradox hold for scientists as well? We study this by utilizing a near-population of ~1.2 million US doctoral recipients from 1977…

2019-09-04abs ↗pdf ↗

This paper describes Simpson's paradox, and explains its serious implications for randomised control trials. In particular, we show that for any number of variables we can simulate the result of a controlled trial which uniformly points to one conclusion (such as 'drug is effective') for every possible combination of t…

2019-12-03abs ↗pdf ↗

New method uses correlation-ratio for transfer learning, improving target model inference.

problem Difficulty in meeting similarity condition for transfer learning.
method Introduces linear correlation-ratio for building accurate relationships between models.
result Improves inference on target model by transferring information from source models.