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,738 papers · 148 categories

Trend · papers per month

3977116154 · Jun 202019922001200920172026
48 results for correlated experts

A new method for sparse Gaussian process regression using correlated experts.

problem Sparse Gaussian process regression for large datasets with cubic computational complexity.
method Aggregating predictions from correlated experts to improve scalability and accuracy.
result Superior performance compared to state-of-the-art methods for synthetic and real-world datasets.

Bayesian model fuses multiple classifiers with explicit correlation modeling.

problem Combining outputs of multiple classifiers with explicit correlation.
method Hierarchical Bayesian model with correlated Dirichlet distribution.
result Fused classifier performance can be Bayes optimal even for highly correlated base classifiers.

The paper presents a novel approach to multi-output regression using probabilistic circuits.

problem Capturing correlations between multiple output dimensions in large-scale regression problems.
method Employing a mixture of single-output Gaussian process experts encoded via a probabilistic circuit.
result The method can capture correlations between output dimensions and often outperforms other approaches.

Paper forecasts corporate default risk using Particle MCMC with expert opinions.

problem Predicting corporate default risk in the U.S. market.
method Bayesian approach with Particle Markov Chain Monte Carlo (Particle MCMC) algorithm.
result Volatility and mean reversion of hidden factor significantly impact default intensities.

This paper considers the challenge of evaluating a set of classifiers, as done in shared task evaluations like the KDD Cup or NIST TREC, without expert labels. While expert labels provide the traditional cornerstone for evaluating statistical learners, limited or expensive access to experts represents a practical bottl…

2012-12-05abs ↗pdf ↗

A new method for faster prediction in distributed Gaussian processes.

problem Inefficient aggregation of distributed Gaussian processes with correlations.
method Proposes a novel approach for aggregated prediction in distributed GPs that incorporates correlations among experts.
result Results in more stable predictions in less time compared to state-of-the-art methods.

STAR improves equivariant and invariant representation learning by routing projection heads.

problem Redundant feature learning in equivariant and invariant representation learning.
method Soft Task-Aware Routing (STAR) for projection heads specialization.
result Lower canonical correlations between invariant and equivariant embeddings.

A new CoVaR framework integrates expert views using entropy pooling.

problem Risk assessment and spillover effects from diverse expert views.
method Entropy pooling method to integrate expert views and compute general CoVaR.
result General CoVaR shows linear relationships with expectations and differences in expectations, and nonlinear dependencies with variance, quantiles, and correlation.

Enhances multimodal generation with Normalizing Flows and correlation analysis.

problem Generating coherent cross-modal data from multiple sources.
method Uses Deep Canonical Correlation Analysis for shared information, Normalizing Flows for diversity, and Product of Experts for scalability.
result Improves likelihood, diversity, and coherence in conditional generation.

Worst-case bounds on the expected shortfall risk given only limited information on the distribution of the random variables has been studied extensively in the literature. In this paper, we develop a new worst-case bound on the expected shortfall when the univariate marginals are known exactly and additional expert inf…

2017-01-16abs ↗pdf ↗

Automatic methods for generating state-of-the-art neural network architectures without human experts have generated significant attention recently. This is because of the potential to remove human experts from the design loop which can reduce costs and decrease time to model deployment. Neural architecture search (NAS)…

2019-03-31abs ↗pdf ↗

Logistic regression can handle noisy labels effectively when labels are imperfectly assigned by multiple experts.

problem Label noise in supervised classification due to manual labelling by multiple experts.
method Using approximate posterior probabilities of class membership from multiple experts to train logistic regression models.
result Logistic regression can be robust to label noise when classification difficulty is the only source of errors.

Gryffin optimizes categorical variables in materials design, leveraging expert knowledge.

problem Optimizing categorical variables in complex design choices like molecule selection.
method Bayesian optimization with smooth approximations to categorical distributions, incorporating expert knowledge.
result Gryffin accelerates discovery of promising molecules and materials, highlighting relevant correlations.

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.

Since manually labeling training data is slow and expensive, recent industrial and scientific research efforts have turned to weaker or noisier forms of supervision sources. However, existing weak supervision approaches fail to model multi-resolution sources for sequential data, like video, that can assign labels to in…

2019-10-21abs ↗pdf ↗

Model identifies key problems in HIV patients' records.

problem Complex and time-consuming task of identifying patient problems from electronic health records.
method Unsupervised phenotyping approach that jointly learns phenotypes from structured and unstructured data.
result Learned phenotypes and their relatedness are clinically valid and surpass existing methods.

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.

A method to select important experts for Gaussian processes to balance computational efficiency and uncertainty quantification.

problem Balancing computational efficiency and uncertainty quantification in Gaussian processes for big data.
method Using graphical models to select important experts and aggregate their predictions while ensuring uncertainty quantification.
result Substantially reduces computational cost of aggregating dependent experts while ensuring calibrated uncertainty quantification.

We consider the problem of contextual bandits with stochastic experts, which is a variation of the traditional stochastic contextual bandit with experts problem. In our problem setting, we assume access to a class of stochastic experts, where each expert is a conditional distribution over the arms given a context. We p…

2018-02-23abs ↗pdf ↗

Improved time series forecasting with expert loss integration.

problem Enhancing time series forecasting accuracy and efficiency.
method Adaptive Mixture-of-Experts framework with expert-specific loss integration and online learning.
result Significantly improved forecasting accuracy and computational efficiency.

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.

Meta-algorithm optimizes nonstochastic bandits with infinitely many experts.

problem Maximizing reward by choosing actions sequentially from a set of experts.
method Proposed a variant of Exp4.P for infinitely many experts and a meta-algorithm.
result Proved high-probability upper bound of ildeO(iK+KT) ilde{\mathcal{O}} \big( i^*K + \sqrt{KT} \big) on regret.

System uses conformal prediction to help experts make accurate decisions without understanding when to trust it.

problem Helping experts make accurate decisions in multiclass classification tasks.
method Develops an automated decision support system using conformal prediction to provide precise prediction sets and an efficient search method.
result System improves expert predictions by providing precise prediction sets and forcing experts to predict from these sets.

Bayesian models combine experts with a flexible gating mechanism for complex data.

problem Theoretical properties of Bayesian mixture-of-experts models with softmax gating remain unexplored.
method Investigated asymptotic behavior of posterior distribution for density estimation, parameter estimation, and model selection.
result Established posterior contraction rates for density estimation and parameter estimation, providing insights for practical model design.

Advice-efficient prediction with expert advice (in analogy to label-efficient prediction) is a variant of prediction with expert advice game, where on each round of the game we are allowed to ask for advice of a limited number MM out of NN experts. This setting is especially interesting when asking for advice of ever…

2013-04-12abs ↗pdf ↗

The study aims to explore the strength of causal relationship between stock price search interest and real stock market outcomes on worldwide equity market indices. Such a phenomenon could also be mediated by investor behavior and extent of news coverage. The stock-specific internet search trends data and corresponding…

2018-04-05abs ↗pdf ↗

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.

New method aggregates Gaussian experts by detecting conditional independence violations.

problem Aggregation of dependent Gaussian experts leads to sub-optimal solutions.
method Uses Gaussian graphical model to detect and correct conditional independence violations.
result Improves aggregation of Gaussian experts, outperforming SOTA DGP approaches.

Improved HMoE models using Laplace gating function enhance expert specialization and performance.

problem Improving performance of hierarchical mixture of experts models.
method Used Laplace gating function instead of Softmax in hierarchical mixture of experts models.
result Laplace gating function accelerates expert convergence and enhances specialization.