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

97194291388 · Jun 202019922001200920172026
48 results for non-expert development

Non-experts have long made important contributions to machine learning (ML) by contributing training data, and recent work has shown that non-experts can also help with feature engineering by suggesting novel predictive features. However, non-experts have only contributed features to prediction tasks already posed by e…

2018-02-14abs ↗pdf ↗

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.

The recent successes of deep learning have led to a wave of interest from non-experts. Gaining an understanding of this technology, however, is difficult. While the theory is important, it is also helpful for novices to develop an intuitive feel for the effect of different hyperparameters and structural variations. We …

2017-08-12abs ↗pdf ↗

New interface explains contextual bandits to non-experts.

problem Interpreting and managing contextual bandits for non-expert operators.
method Developed a metric 'value gain' for off-policy evaluation and designed an interface to explain bandit behavior.
result Empowered non-experts to manage complex machine learning systems through accessible presentation.

A framework for faster, better infographic design by non-experts and experts alike.

problem Designing infographics is time-consuming and tedious for non-experts and even professionals.
method Semi-automated infographic framework for structured and flow-based designs, including automatic design ranking and customization options.
result Designers from all expertise levels can generate generic infographic designs faster than existing methods while maintaining quality.

The paper proposes methods to identify and sample from mixtures of Mallows models for top-k rankings.

problem Identifying and sampling from mixtures of Mallows models for top-k rankings in a heterogeneous population.
method Efficient sampling algorithms and identifiability proofs for both components of the mixture.
result The identifiability and learnability of the Mallows components' parameters in the mixture.

Deep reinforcement learning has achieved great successes in recent years, however, one main challenge is the sample inefficiency. In this paper, we focus on how to use action guidance by means of a non-expert demonstrator to improve sample efficiency in a domain with sparse, delayed, and possibly deceptive rewards: the…

2019-07-25abs ↗pdf ↗

ML4Chem offers a user-friendly platform for developing and deploying machine learning models in chemistry.

problem Developing and deploying machine learning models in chemistry and materials science.
method User-experience design, six core building blocks: data, featurization, models, model optimization, inference, and visualization.
result Ease of use and functionality of the atomistic module for neural networks and kernel ridge regression.

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 ↗

The random forest algorithm, proposed by L. Breiman in 2001, has been extremely successful as a general-purpose classification and regression method. The approach, which combines several randomized decision trees and aggregates their predictions by averaging, has shown excellent performance in settings where the number…

2015-11-18abs ↗pdf ↗

We present a self-contained proof of the Gauss-Bonnet theorem for two-dimensional surfaces embedded in R3R^3 using just classical vector calculus. The exposition should be accessible to advanced undergraduate and non-expert graduate students. It may be viewed as an illustration and exercise in multivariate calculus and…

2017-01-06abs ↗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 ↗

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 ↗

Concept Hierarchies and Formal Concept Analysis are theoretically well grounded and largely experimented methods. They rely on line diagrams called Galois lattices for visualizing and analysing object-attribute sets. Galois lattices are visually seducing and conceptually rich for experts. However they present important…

2013-03-11abs ↗pdf ↗

A popular method for selecting the number of clusters is based on stability arguments: one chooses the number of clusters such that the corresponding clustering results are "most stable". In recent years, a series of papers has analyzed the behavior of this method from a theoretical point of view. However, the results …

2010-07-07abs ↗pdf ↗

We will simplify the earlier proofs of Perelman's collapsing theorem of 3-manifolds given by Shioya-Yamaguchi and Morgan-Tian. Among other things, we use Perelman's semi-convex analysis of distance functions to construct the desired local Seifert fibration structure on collapsed 3-manifolds. The verification of Perelma…

2009-08-22abs ↗pdf ↗

The Infinite Relational Model (IRM) is a probabilistic model for relational data clustering that partitions objects into clusters based on observed relationships. This paper presents Averaged CVB (ACVB) solutions for IRM, convergence-guaranteed and practically useful fast Collapsed Variational Bayes (CVB) inferences. W…

2014-09-16abs ↗pdf ↗

Axioms of Lie algebroid are discussed in order to review some known aspects for non-experts. In particular, it is shown that a Lie QD-algebroid (i.e. a Lie algebra bracket on the Functions(M)-module F of sections of a vector bundle E over a manifold M which satisfies [X,fY]=f[X,Y]+A(X,f)Y for all X,Y from F, all f from…

2003-01-21abs ↗pdf ↗

We will simplify earlier proofs of Perelman's collapsing theorem for 3-manifolds given by Shioya-Yamaguchi and Morgan-Tian. Among other things, we use Perelman's critical point theory (e.g., multiple conic singularity theory and his fibration theory) for Alexandrov spaces to construct the desired local Seifert fibratio…

2010-03-10abs ↗pdf ↗

Bayesian optimization has emerged as a strong candidate tool for global optimization of functions with expensive evaluation costs. However, due to the dynamic nature of research in Bayesian approaches, and the evolution of computing technology, using Bayesian optimization in a parallel computing environment remains a c…

2018-07-01abs ↗pdf ↗

ChemCrow enhances LLMs for chemistry tasks, automating complex chemical processes.

problem Limited access to computational chemistry tools for large-language models.
method Integrating 18 expert-designed chemistry tools into an LLM (ChemCrow).
result ChemCrow autonomously plans and executes chemical syntheses and discoveries.

In many machine learning applications, crowdsourcing has become the primary means for label collection. In this paper, we study the optimal error rate for aggregating labels provided by a set of non-expert workers. Under the classic Dawid-Skene model, we establish matching upper and lower bounds with an exact exponent …

2016-05-25abs ↗pdf ↗

Crowdsourcing has become a popular method for collecting labeled training data. However, in many practical scenarios traditional labeling can be difficult for crowdworkers (for example, if the data is high-dimensional or unintuitive, or the labels are continuous). In this work, we develop a novel model for crowdsourcin…

2017-12-13abs ↗pdf ↗

Algorithm selection and hyperparameter tuning remain two of the most challenging tasks in machine learning. Automated machine learning (AutoML) seeks to automate these tasks to enable widespread use of machine learning by non-experts. This paper introduces OBOE, a collaborative filtering method for time-constrained mod…

2018-08-09abs ↗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.

Recent progress in AutoML has lead to state-of-the-art methods (e.g., AutoSKLearn) that can be readily used by non-experts to approach any supervised learning problem. Whereas these methods are quite effective, they are still limited in the sense that they work for tabular (matrix formatted) data only. This paper descr…

2019-06-21abs ↗pdf ↗

Object detection is a computer vision field that has applications in several contexts ranging from biomedicine and agriculture to security. In the last years, several deep learning techniques have greatly improved object detection models. Among those techniques, we can highlight the YOLO approach, that allows the const…

2018-09-06abs ↗pdf ↗

Robo-advisors estimate clients' risk aversion using interactive questionnaires.

problem Estimating risk aversion of non-expert clients using adaptive questionnaires.
method Model risk aversion with cost functions and spectral risk measures. Use inverse reinforcement learning to design questions maximizing distinguishing power.
result Designing questions by maximizing distinguishing power achieves satisfactory accuracy in learning risk aversion with fewer than 50 questions.

For sophisticated reinforcement learning (RL) systems to interact usefully with real-world environments, we need to communicate complex goals to these systems. In this work, we explore goals defined in terms of (non-expert) human preferences between pairs of trajectory segments. We show that this approach can effective…

2017-06-12abs ↗pdf ↗

Online health communities are a valuable source of information for patients and physicians. However, such user-generated resources are often plagued by inaccuracies and misinformation. In this work we propose a method for automatically establishing the credibility of user-generated medical statements and the trustworth…

2017-05-06abs ↗pdf ↗