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

20416181 · Jun 202019922001200920172026
48 results for expert survey

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.

The paper provides an algorithm for the risk estimation when a company selects an outsourcing service provider for innovation product. Calculations are based on expert surveys conducted among customers and among providers of outsourcing. The surveys assessed the degree of materiality of species at risk.

2016-03-16abs ↗pdf ↗

Machine learning (ML) has become a vital part in many aspects of our daily life. However, building well performing machine learning applications requires highly specialized data scientists and domain experts. Automated machine learning (AutoML) aims to reduce the demand for data scientists by enabling domain experts to…

2019-04-26abs ↗pdf ↗

This article is a survey article on geometric group theory from the point of view of a non-expert who likes geometric group theory and uses it in his own research. The sections are: classical examples, basics about quasiisometry,properties and invariants of groups invariant under quasiisometry, rigidity, hyperbolic spa…

2008-06-23abs ↗pdf ↗

The rapid development of computing power and efficient Markov Chain Monte Carlo (MCMC) simulation algorithms have revolutionized Bayesian statistics, making it a highly practical inference method in applied work. However, MCMC algorithms tend to be computationally demanding, and are particularly slow for large datasets…

2018-07-23abs ↗pdf ↗

This article is a survey on the braid groups, the Artin groups, and the Garside groups. It is a presentation, accessible to non-experts, of various topological and algebraic aspects of these groups. It is also a report on three points of the theory: the faithful linear representations, the cohomology, and the geometric…

2007-11-15abs ↗pdf ↗

Survey on ML for wireless network optimization across PHY, MAC, and network layers.

problem Improving wireless network performance using machine learning.
method Comprehensive review of ML-based techniques for wireless network optimization.
result Machine learning can significantly enhance wireless network QoS and QoE across all layers.

This is a survey paper focusing on the interplay between the curvature and topology of a Riemannian manifold. The first part of the paper provides a background discussion, aimed at non-experts, of Hopf's pinching problem and the Sphere Theorem. In the second part, we sketch the proof of the Differentiable Sphere Theore…

2010-01-13abs ↗pdf ↗

Deep Learning has enabled remarkable progress over the last years on a variety of tasks, such as image recognition, speech recognition, and machine translation. One crucial aspect for this progress are novel neural architectures. Currently employed architectures have mostly been developed manually by human experts, whi…

2018-08-16abs ↗pdf ↗

We investigate a class of hierarchical mixtures-of-experts (HME) models where exponential family regression models with generalized linear mean functions of the form psi(ga+fx^Tfgb) are mixed. Here psi(...) is the inverse link function. Suppose the true response y follows an exponential family regression model with mea…

2013-01-30abs ↗pdf ↗

The last few years have seen an explosion of academic and popular interest in algorithmic fairness. Despite this interest and the volume and velocity of work that has been produced recently, the fundamental science of fairness in machine learning is still in a nascent state. In March 2018, we convened a group of expert…

2018-10-20abs ↗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.

With the continuous and vast increase in the amount of data in our digital world, it has been acknowledged that the number of knowledgeable data scientists can not scale to address these challenges. Thus, there was a crucial need for automating the process of building good machine learning models. In the last few years…

2019-06-05abs ↗pdf ↗

Mirzakhani's thesis counts geodesics on hyperbolic surfaces, finding a specific asymptotic formula.

problem Counting simple closed geodesics on hyperbolic surfaces.
method Inspired by lattice point counting, uses principles of homogeneous dynamics.
result The number of simple closed geodesics of length ≤ L is asymptotic to L^(6g-6) times a constant.

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.

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.

Overview of integrable systems with symmetries, focusing on toric and semitoric systems.

problem Classifying and understanding integrable systems with symmetries.
method Using decorated polygons and controlled bifurcations in one-parameter families of systems.
result Construction of explicit semitoric systems with prescribed invariants.

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.