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

22446587 · Jun 202019922001200920172026
48 results for Expert competence

Competency questions help experts select best clustering for energy data.

problem Ad hoc and subjective selection of clustering structures by domain experts.
method Formalize expert knowledge and requirements with competency questions.
result Competency questions improve reproducibility and evaluation of clustering applications.

Mathematical approach assesses human resource competences accurately.

problem Accurate assessment and representation of human resource competences.
method Detailed quantification scheme and mathematical approach.
result Flexible tools for optimal job assignment and recruitment.

Improves online learning with expert demonstrations, quality matters.

problem Improving online learning through offline demonstration data.
method Thompson sampling applied to a multi-armed bandit model, informed by expert demonstrations and Bayes' rule.
result Substantial empirical regret reduction with expert demonstrations, improving online performance.

Generalized algorithm for translation and scale-invariant prediction.

problem Sequential prediction with expert advice, focusing on translation and scale invariance.
method Designing a generalized online algorithm using the universal prediction perspective to compete against a generic class of expert selection strategies.
result No preliminary knowledge of loss sequences is required; performance bounds are stable under arbitrary scalings and translations.

We revisit the classical decision-theoretic problem of weighted expert voting from a statistical learning perspective. In particular, we examine the consistency (both asymptotic and finitary) of the optimal Nitzan-Paroush weighted majority and related rules. In the case of known expert competence levels, we give sharp …

2013-12-02abs ↗pdf ↗

Optimizes quantile and semi-adversarial regret with novel root-logarithmic regularizers.

problem Minimizes regret in adversarial and semi-adversarial online learning.
method FTRL with root-logarithmic regularizers for quantile and semi-adversarial settings.
result Achieves minimax optimal regret bounds in both paradigms.

New findings explain why online methods outperform offline methods in noisy expert feedback settings.

problem The challenge of learning from imperfect expert feedback in sequential decision-making systems.
method Introduced a noisy expert model and a novel variant of on-policy distillation (OPD) to address the gap between offline and online imitation learning.
result Online interaction with a noisy expert via OPD enables polynomial dependence on the horizon, unlike offline methods which require exponential growth in sample complexity.

Adaptive Bayesian learning aggregates experts to improve performance.

problem Bayesian online learning's performance depends on inferential choices.
method Treat Bayesian update rules as experts and aggregate them based on sequential predictive losses.
result The aggregate competes with the best expert in hindsight at a low aggregation cost.

NAMEx merges experts using Nash bargaining for improved performance.

problem Sparse Mixture of Experts merging strategies lack a principled weighting mechanism.
method Reinterpreting expert merging through game theory, introducing Nash Merging and complex momentum.
result NAMEx consistently outperforms competing methods across various tasks and system sizes.

Experts predict significant adoption of decentralized finance by 2034, with traditional finance adapting.

problem Adoption and integration of decentralized finance (DeFi) in financial services.
method Survey analysis using New Institutional Economics and Dynamic Capabilities Theory.
result Experts expect adoption of DeFi to rise from negligible to 43% by 2034, with traditional finance likely to embrace it.

New bounds on minimax regret for sequential probability assignment using logarithmic loss.

problem Minimizing regret in sequential probability assignment against arbitrary experts.
method Using self-concordance property of logarithmic loss to derive tight bounds.
result Tight bounds on minimax regret for various expert classes.

Improved transfer learning with expert models, reducing compute and speeding up performance.

problem Improving sample efficiency and reducing computational requirements for new tasks.
method Training a diverse set of experts using existing label structures and performance proxies to select the relevant expert for each target task.
result Significant speed-up of 2-3 orders of magnitude compared to competing approaches.

Paper proposes an efficient online learning method using an offline dataset for infinite horizon MDPs.

problem Efficient online reinforcement learning in infinite horizon MDPs with an unknown expert policy.
method Bayesian approach to model the expert's policy and minimize cumulative regret.
result Upper bound on regret of ildeO(T) ilde{O}(\sqrt{T}) for the Informed PSRL algorithm.

A new method for multi-expert learning-to-defer avoids optimization issues.

problem Optimization issues in multi-expert learning-to-defer systems.
method A decoupled surrogate with a softmax classifier head and independent sigmoid heads per expert.
result First multi-expert L2D guarantee with a constant not growing with the expert pool.

New algorithms adaptively compete against complex environments with local regularities.

problem Efficiently competing against complex, locally regular comparator functions in nonparametric settings.
method Locally-adaptive online algorithms using hierarchical εε-nets and tree experts.
result Proved regret bounds scaling with different types of local regularities, delivering better performance for simple profiles.

SurvMixClust clusters survival data and predicts individual survival curves.

problem Integrating clustering into survival analysis for precision medicine.
method SurvMixClust learns latent representations for clustering and predicts survival functions using a mixture of non-parametric experts.
result SurvMixClust creates balanced clusters with distinct survival curves, outperforming clustering baselines and competing with non-clustering models in predictive accuracy.

Developing active inference agents for edge devices with limited resources.

problem Creating effective active inference agents on edge devices with limited computational resources.
method Introducing a software toolbox to accelerate the development of active inference agents by non-experts.
result Accelerates the democratization of active inference agents for edge devices.

Statistical learning relies upon data sampled from a distribution, and we usually do not care what actually generated it in the first place. From the point of view of causal modeling, the structure of each distribution is induced by physical mechanisms that give rise to dependences between observables. Mechanisms, howe…

2017-12-04abs ↗pdf ↗

Imitation learning algorithms can be used to learn a policy from expert demonstrations without access to a reward signal. However, most existing approaches are not applicable in multi-agent settings due to the existence of multiple (Nash) equilibria and non-stationary environments. We propose a new framework for multi-…

2018-07-26abs ↗pdf ↗

Deep RL drone trained to compete against classical path planning in drone racing.

problem Optimizing long-term drone racing strategies using reinforcement learning.
method Used PPO algorithm on a simulated quadrotor in a racing environment created with AirSim.
result Deep RL agent outperformed classical path planning in drone racing competitions.

GH-PID uses guided harmonic paths for efficient SOT with interpretable diagnostics.

problem Efficiently solving Stochastic Optimal Transport with hard terminal distributions and soft costs.
method Guided Harmonic Path-Integral Diffusion (GH-PID) framework with low-dimensional guidance.
result GH-PID generates geometry-aware, cost-reducing trajectories that match terminal distributions.

In a recent paper [1] we introduced the Fuzzy Bayesian Learning (FBL) paradigm where expert opinions can be encoded in the form of fuzzy rule bases and the hyper-parameters of the fuzzy sets can be learned from data using a Bayesian approach. The present paper extends this work for selecting the most appropriate rule b…

2017-03-29abs ↗pdf ↗

This paper tackles optimal bidding strategies in adversarial first-price auctions.

problem How to bid optimally and efficiently in adversarial first-price auctions.
method Developed a minimax optimal online bidding algorithm leveraging expert-chaining structure and exploiting product structure.
result Achieved an O~(T)\widetilde{O}(\sqrt{T}) regret, superior to existing algorithms.

Near-logarithmic regret per switch achieved for mixable/exp-concave losses.

problem Online optimization of mixable loss functions with dynamic environments.
method Online mixture framework using static solvers and hyper-expert creations.
result Near-logarithmic regret per switch with sub-polynomial complexity.

We propose an online method for concept driftdetection based on dynamic classifier ensemble selection. Theproposed method generates a pool of ensembles by promotingdiversity among classifier members and chooses expert ensemblesaccording to global prequential accuracy values. Unlike currentdynamic ensemble selection app…

2019-09-26abs ↗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.

Probabilistic forecasts in the form of probability distributions over future events have become popular in several fields of statistical science. The dissimilarity between a probability forecast and an outcome is measured by a loss function (scoring rule). Popular example of scoring rule for continuous outcomes is the …

2019-02-26abs ↗pdf ↗

PAMA learns covariate importance for better matching in observational studies.

problem Poor performance of conventional matching methods when covariates differ in relevance.
method PAMA is a semi-supervised framework that learns covariate importance from paired data and optimizes a weighted quadratic score.
result PAMA outperforms standard methods, particularly in high-dimensional settings and under model misspecification.

Dynamic Ensemble Selection (DES) techniques aim to select locally competent classifiers for the classification of each new test sample. Most DES techniques estimate the competence of classifiers using a given criterion over the region of competence of the test sample (its the nearest neighbors in the validation set). T…

2018-04-18abs ↗pdf ↗

Estimating machine learning performance 'in the wild' is both an important and unsolved problem. In this paper, we seek to examine, understand, and predict the pointwise competence of classification models. Our contributions are twofold: First, we establish a statistically rigorous definition of competence that general…

2019-10-24abs ↗pdf ↗

Dynamic regressor selection (DRS) systems work by selecting the most competent regressors from an ensemble to estimate the target value of a given test pattern. This competence is usually quantified using the performance of the regressors in local regions of the feature space around the test pattern. However, choosing …

2019-04-09abs ↗pdf ↗

Optimal model averaging for conditional generative models improves performance across various data types.

problem Multiple plausible generators for conditional distributions can vary in performance.
method Sample-based maximum mean discrepancy, static model averaging, and mixture-of-experts model averaging.
result MoEMA improves over competing baselines across various data types.

Effective utilization of photovoltaic (PV) plants requires weather variability robust global solar radiation (GSR) forecasting models. Random weather turbulence phenomena coupled with assumptions of clear sky model as suggested by Hottel pose significant challenges to parametric & non-parametric models in GSR conversio…

2017-11-22abs ↗pdf ↗

There is tremendous interest in precision medicine as a means to improve patient outcomes by tailoring treatment to individual characteristics. An individualized treatment rule formalizes precision medicine as a map from patient information to a recommended treatment. A treatment rule is defined to be optimal if it max…

2017-11-28abs ↗pdf ↗

Multi-expert L2D underfits more severely, requiring new methods.

problem Underfitting in multi-expert L2D settings.
method PiCCE (Pick the Confident and Correct Expert), a surrogate-based method.
result PiCCE effectively reduces multi-expert L2D to a single-expert-like problem, resolving underfitting.

Existing Markov Chain Monte Carlo (MCMC) methods are either based on general-purpose and domain-agnostic schemes which can lead to slow convergence, or hand-crafting of problem-specific proposals by an expert. We propose A-NICE-MC, a novel method to train flexible parametric Markov chain kernels to produce samples with…

2017-06-23abs ↗pdf ↗

SurvivalBoost improves prediction of event times in competing risks scenarios.

problem Predicting event times in scenarios with multiple possible outcomes.
method Developed a strictly proper censoring-adjusted scoring rule for stochastic optimization of competing risks.
result SurvivalBoost outperforms 12 state-of-the-art models across various metrics.

Survival analysis in the presence of multiple possible adverse events, i.e., competing risks, is a pervasive problem in many industries (healthcare, finance, etc.). Since only one event is typically observed, the incidence of an event of interest is often obscured by other related competing events. This nonidentifiabil…

2018-07-16abs ↗pdf ↗

TENP prunes experts and neurons in Mixture-of-Experts models for efficient deployment.

problem Efficient deployment of large language models constrained by static parameter footprint.
method Structured Trapezoidal ExpertNeuron Pruning (TENP) identifies and retains important experts and neurons.
result DeepSeek model achieves 10% better performance on code generation tasks with 40% expert sparsity.

This paper uses neural networks to accurately model competing risks in survival analysis.

problem Ignoring competing risks leads to biased survival estimation in machine learning models.
method The paper introduces constrained monotonic neural networks to model each competing survival distribution.
result The method ensures exact likelihood maximization with reduced computational cost.