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

219437656874 · Jun 202019922001200920172026
48 results for algorithmic contestability

New framework for contesting algorithmic decisions, not just explaining them.

problem Helping individuals review and correct erroneous algorithmic decisions.
method Operationalized contestability as a natural complement to explainable AI (XAI), identifying three types of evidence for reversal.
result Existing EU legislation already grants individuals legal rights to contest algorithmic decisions.

This paper discusses the gambling contest introduced in Seel & Strack (Gambling in contests, Discussion Paper Series of SFB/TR 15 Governance and the Efficiency of Economic Systems 375, Mar 2012.) and considers the impact of adding a penalty associated with failure to follow a winning strategy. The Seel & Strack model c…

2013-01-04abs ↗pdf ↗

Study optimal reward schemes for inducing desired player performance in risky contests.

problem Designing optimal rewards to encourage desired performance levels in risky contests.
method Analyzed the optimal reward schemes for inducing average and specific rank performance.
result Optimal reward schemes can have surprising shapes, not just related to inequality.

In matrix factorization, available graph side-information may not be well suited for the matrix completion problem, having edges that disagree with the latent-feature relations learnt from the incomplete data matrix. We show that removing these contested\textit{contested} edges improves prediction accuracy and scalability. We…

2019-08-25abs ↗pdf ↗

We introduce a two-player contest for evaluating the safety and robustness of machine learning systems, with a large prize pool. Unlike most prior work in ML robustness, which studies norm-constrained adversaries, we shift our focus to unconstrained adversaries. Defenders submit machine learning models, and try to achi…

2018-09-22abs ↗pdf ↗

Proposes a method for neural networks to learn causal relationships and humans to contest and modify them.

problem Neural networks learn relevant causal relationships unclearly and are black-box, making them hard to debug.
method Two-way interaction between neural networks and humans, allowing contestation and modification of causal graphs.
result Improves predictive performance up to 2.4x and produces smaller networks up to 7x compared to SOTA.

Recently, sentiment analysis has received a lot of attention due to the interest in mining opinions of social media users. Sentiment analysis consists in determining the polarity of a given text, i.e., its degree of positiveness or negativeness. Traditionally, Sentiment Analysis algorithms have been tailored to a speci…

2016-12-15abs ↗pdf ↗

DisCoveR efficiently discovers declarative process models from event logs.

problem Mining declarative process models from event logs efficiently and accurately.
method DisCoveR precisely formalizes an algorithm, uses a bit vector implementation, and rigorously evaluates performance.
result DisCoveR outperforms other declarative miners in accuracy and runtime.

We introduce a new molecular dataset, named Alchemy, for developing machine learning models useful in chemistry and material science. As of June 20th 2019, the dataset comprises of 12 quantum mechanical properties of 119,487 organic molecules with up to 14 heavy atoms, sampled from the GDB MedChem database. The Alchemy…

2019-06-22abs ↗pdf ↗

Paper improves financial trading models using GPU parallelism.

problem Challenges in policy instability and sampling bottlenecks in reinforcement learning for financial tasks.
method Revisits ensemble methods with massively parallel simulations on GPUs.
result Significantly improved computational efficiency and robustness of financial decision-making strategies.

The study analyzes games and social hierarchies, incorporating luck and depth of competition.

problem Analyzing patterns of wins and losses in games and social hierarchies.
method Generalized probabilistic models incorporating luck and depth of competition.
result Social competition tends to be deeper with many distinct levels, but there is often a chance of upset victories.

Box Thirding identifies the best arm efficiently under limited samples.

problem Efficiently identifying the best arm with limited sampling.
method Iterative ternary comparison of arms, discarding the weakest and exploring the best.
result Achieves comparable performance to Successive Halving with less predefined parameters.

ARFs generate plausible counterfactuals for models, improving model understanding.

problem Creating realistic counterfactuals for model analysis.
method Adversarial Random Forests (ARFs) for generating plausible counterfactuals.
result ARFs efficiently generate plausible counterfactuals in a model-agnostic way.

Machine learning competitions such as those organized by Kaggle or KDD represent a useful benchmark for data science research. In this work, we present our winning solution to the Game Data Mining competition hosted at the 2017 IEEE Conference on Computational Intelligence and Games (CIG 2017). The contest consisted of…

2019-01-16abs ↗pdf ↗

This paper presents a general framework for studying diverse beliefs in dynamic economies. Within this general framework, the characterization of a central-planner general equilbrium turns out to be very easy to derive, and leads to a range of interesting applications. We show how for an economy with log investors hold…

2010-01-11abs ↗pdf ↗

This paper investigates Shampoo's heuristics and decouples preconditioner updates.

problem Improving Shampoo's heuristics for training neural networks.
method Decomposing preconditioner updates, correcting eigenvalues, and adapting eigenbasis computation frequency.
result Principled techniques to remove Shampoo's heuristics and improve training algorithms.

We propose an original model for inferring team strengths using a Markov Random Field, which can be used to generate historical estimates of the offensive and defensive strengths of a team over time. This model was designed to be applied to sports such as soccer or hockey, in which contest outcomes take value in a limi…

2013-05-09abs ↗pdf ↗

We propose an alternative framework to existing setups for controlling false alarms when multiple A/B tests are run over time. This setup arises in many practical applications, e.g. when pharmaceutical companies test new treatment options against control pills for different diseases, or when internet companies test the…

2017-06-16abs ↗pdf ↗

Study analyzes neural network models to understand generalization performance.

problem Understanding good generalization in neural networks.
method Analyzed a corpus of models from a public contest, breaking ALPHAHAT into scale and shape metrics.
result Identified a Simpson's paradox in metric performance across different model depths and regularization hyperparameters.

In this paper we study some aspects of knots and links in lens spaces. Namely, if we consider lens spaces as quotient of the unit ball B3B^{3} with suitable identification of boundary points, then we can project the links on the equatorial disk of B3B^{3}, obtaining a regular diagram for them. In this contest, we obtai…

2012-09-28abs ↗pdf ↗

In retail, there are predictable yet dramatic time-dependent patterns in customer behavior, such as periodic changes in the number of visitors, or increases in customers just before major holidays. The current paradigm of multi-armed bandit analysis does not take these known patterns into account. This means that for a…

2015-05-21abs ↗pdf ↗

In this paper we study iterative procedures for stationary equilibria in games with large number of players. Most of learning algorithms for games with continuous action spaces are limited to strict contraction best reply maps in which the Banach-Picard iteration converges with geometrical convergence rate. When the be…

2012-10-17abs ↗pdf ↗

Look-ahead reasoning helps predict strategic user behavior on learning platforms.

problem Optimization criteria on learning platforms do not reflect users' priorities.
method Formalized level-k thinking and contrasted collective and selfish behavior.
result Coordination benefits users but does not offer higher-level reasoning advantages in the long run.

Big data, data science, deep learning, artificial intelligence are the key words of intense hype related with a job market in full evolution, that impose to adapt the contents of our university professional trainings. Which artificial intelligence is mostly concerned by the job offers? Which methodologies and technolog…

2018-09-28abs ↗pdf ↗

Bayesian rating system for large competitions improves prediction and efficiency.

problem Rating systems for large, competitive events like online programming contests.
method Developed a Bayesian rating system for many participants, proving robustness and runtime.
result The system outperforms existing systems in accuracy and computation speed.

Develops a framework to test excessive influence of small data subsets.

problem Identifying when small data subsets significantly impact model conclusions.
method Formalizes the concept of most influential sets, deriving influence formulas and extreme value distributions.
result Allows rigorous hypothesis testing for excessive influence, resolving contested findings.

ML4CO uses machine learning to improve combinatorial optimization solvers.

problem Solving combinatorial problems in practice often involves related data distributions.
method Replacing heuristic components with machine learning approaches.
result Improved state-of-the-art combinatorial optimization solvers.

FinRLlama wins FinRL Challenge 2024 by fine-tuning LLMs with market data.

problem Lack of contextual alignment for financial market applications in traditional LLMs.
method Fine-tuning LLaMA-3.2-3B-Instruct model with custom RLMF prompt design integrating historical data and reward feedback.
result RLMF-tuned FinRLlama framework outperforms baseline methods in signal consistency and trading outcomes.

Top 8 robotic vision systems tackled lifelong object recognition challenges.

problem Lifelong learning in robotic vision for varied, dynamic environments.
method Design of a dataset with diverse conditions and rules for evaluation.
result Robotic vision systems improved over time with dynamic object appearances.

We present a new modeling technique for solving the problem of ecological inference, in which individual-level associations are inferred from labeled data available only at the aggregate level. We model aggregate count data as arising from the Poisson binomial, the distribution of the sum of independent but not identic…

2018-02-04abs ↗pdf ↗

Researchers calibrate an adaptive Farmer-Joshi model to recover stylized facts in financial markets.

problem Recovering stylized facts in financial markets using the Farmer-Joshi model.
method Calibrated an adaptive Farmer-Joshi model using genetic and Nelder-Mead algorithms, incorporating agent adaptation.
result The adaptive model recovers additional stylized facts, including auto-correlations and kurtosis, compared to the original model.

Proposes a new method to explain model predictions for consumer recourse.

problem Current explanation methods fail to provide meaningful recourse to decision subjects.
method Develops feature responsiveness scores to highlight actionable features.
result Standard practices can undermine decision subjects by highlighting unresponsive features.

In this paper we construct an A\mathcal{A}_\infty-category associated to a Legendrian submanifold of jet spaces. Objects of the category are augmentations of the Chekanov algebra A(Λ)\mathcal{A}(Λ) and the homology of the morphism spaces forms a new set of invariants of Legendrian submanifolds called the bilinearised Le…

2012-10-27abs ↗pdf ↗

EHR-MPC optimizes sepsis treatment using digital twins and inference-time control.

problem Optimal sepsis treatment policies are contested and difficult to adapt during inference.
method EHR-MPC decouples learning patient dynamics from treatment optimization, enabling inference-time control over learned digital twins.
result EHR-MPC achieves comparable off-policy performance and improved simulation performance compared to RL baselines.