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

2356 · Jun 202019922001200920172026
48 results for user-friendly

TRUST improves tree models' accuracy while maintaining interpretability.

problem Piecewise-constant regression trees lack in predictive accuracy compared to black-box models.
method Combines Random Forest accuracy with interpretability of shallow trees and sparsity of linear models, using LLMs for explanations.
result TRUST outperforms other interpretable models in predictive accuracy and matches Random Forest's accuracy.

A simplified, user-friendly repackaging of the curvature estimates implied by the Seiberg-Witten equations is formulated in terms of the convex hull of the set of monopole classes. New results are also obtained concerning boundary cases of the resulting forms of the curvature estimates.

2006-11-15abs ↗pdf ↗

Financial decisions impact our lives, and thus everyone from the regulator to the consumer is interested in fair, sound, and explainable decisions. There is increasing competitive desire and regulatory incentive to deploy AI mindfully within financial services. An important mechanism towards that end is to explain AI d…

2019-06-24abs ↗pdf ↗

Flexible Cox model for time-dependent covariates with complex sparsity patterns.

problem Lack of flexibility in enforcing specific sparsity patterns in time-dependent Cox models.
method Proposes a flexible framework for variable selection in time-dependent Cox models, accommodating complex selection rules.
result Achieves accurate estimation with low false alarm rates for complex covariate structures.

We prove that every Legendrian knot in the tight contact structure of the 3-sphere is determined by the contactomorphism type of its exterior. Moreover, by giving counterexamples we show this to be not true for Legendrian links in the tight 3-sphere. On the way a new user-friendly formula for computing the Thurston-Ben…

2016-04-18abs ↗pdf ↗

For a given cusped 3-manifold MM admitting an ideal triangulation, we describe a method to rigorously prove that either MM or a filling of MM admits a complete hyperbolic structure via verified computer calculations. Central to our method are an implementation of interval arithmetic and Krawczyk's Test. These techni…

2013-10-12abs ↗pdf ↗

Improves medication name inference for telemedicine and conversational agents.

problem Challenges in mapping user-friendly medication names to standardized ones.
method Entity-boosted two-tower neural network for ranking SMN to DMP.
result State-of-the-art results achieved with improved attention-based ranking.

InferPy is a Python package for probabilistic modeling with deep neural networks. It defines a user-friendly API that trades-off model complexity with ease of use, unlike other libraries whose focus is on dealing with very general probabilistic models at the cost of having a more complex API. In particular, this packag…

2019-08-29abs ↗pdf ↗

Interpretable machine learning tackles the important problem that humans cannot understand the behaviors of complex machine learning models and how these models arrive at a particular decision. Although many approaches have been proposed, a comprehensive understanding of the achievements and challenges is still lacking…

2018-07-31abs ↗pdf ↗

We show that a simple modification of the 1-nearest neighbor classifier yields a strongly Bayes consistent learner. Prior to this work, the only strongly Bayes consistent proximity-based method was the k-nearest neighbor classifier, for k growing appropriately with sample size. We will argue that a margin-regularized 1…

2014-07-01abs ↗pdf ↗

One of the major challenges in machine learning nowadays is to provide predictions with not only high accuracy but also user-friendly explanations. Although in recent years we have witnessed increasingly popular use of deep neural networks for sequence modeling, it is still challenging to explain the rationales behind …

2019-07-23abs ↗pdf ↗

This paper describes Convex, a convex optimization modeling framework in Julia. Convex translates problems from a user-friendly functional language into an abstract syntax tree describing the problem. This concise representation of the global structure of the problem allows Convex to infer whether the problem complies …

2014-10-17abs ↗pdf ↗

Optimization on manifolds is a rapidly developing branch of nonlinear optimization. Its focus is on problems where the smooth geometry of the search space can be leveraged to design efficient numerical algorithms. In particular, optimization on manifolds is well-suited to deal with rank and orthogonality constraints. S…

2013-08-23abs ↗pdf ↗

PoPPy is a Point Process toolbox based on PyTorch, which achieves flexible designing and efficient learning of point process models. It can be used for interpretable sequential data modeling and analysis, e.g., Granger causality analysis of multi-variate point processes, point process-based simulation and prediction of…

2018-10-23abs ↗pdf ↗

We study the manifold of all Riemannian metrics over a closed, finite-dimensional manifold. In particular, we investigate the topology on the manifold of metrics induced by the distance function of the L^2 Riemannian metric - so called because it induces an L^2 topology on each tangent space. It turns out that this top…

2010-01-14abs ↗pdf ↗

Over the past decade, contextual bandit algorithms have been gaining in popularity due to their effectiveness and flexibility in solving sequential decision problems---from online advertising and finance to clinical trial design and personalized medicine. At the same time, there are, as of yet, surprisingly few options…

2018-11-06abs ↗pdf ↗

Estimates covariance matrices with correlations between samples.

problem Estimating large-dimensional covariance matrices with correlated samples.
method Generalized Marcenko-Pastur equation and Ledoit-Peche shrinkage estimator using random matrix theory and free probability. Developed an efficient algorithm based on Ledoit-Wolf kernel estimation.
result Efficient algorithm for estimating large covariance matrices with correlations.

Picasso is a new library for sparse learning problems in R and Python.

problem Sparse learning problems in high-dimensional data analysis.
method Unified framework of pathwise coordinate optimization with efficient active set selection strategies.
result picasso can efficiently handle large-scale problems.

SplitWise enhances stepwise regression by adaptively encoding numeric predictors into binary features.

problem Capturing nonlinear relationships in regression models without sacrificing interpretability.
method Adaptive encoding of numeric predictors into binary features using shallow decision trees, assessed by AIC or BIC.
result Consistently produces more parsimonious and generalizable models than traditional techniques.

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.

Mixture models are powerful statistical models used in many applications ranging from density estimation to clustering and classification. When dealing with mixture models, there are many issues that the experimenter should be aware of and needs to solve. The MixEst toolbox is a powerful and user-friendly package for M…

2015-07-22abs ↗pdf ↗

ALICE combines feature selection and inter-rater agreeability for ML model insights.

problem Improving interpretability of black box machine learning models.
method Integrates feature selection and inter-rater agreeability into a user-friendly Python library.
result Initial experiments on customer churn modeling show promising insights.

This paper introduces a new type of open book decomposition for a contact three-manifold with a specified characteristic foliation Fξ\mathcal{F}_ξ on its boundary. These \textit{foliated open books} offer a finer tool for studying contact manifolds with convex boundary than existing models, as the boundary foliation ca…

2020-02-05abs ↗pdf ↗

A new R package for high-dimensional regression and precision matrix estimation.

problem High-dimensional linear regression and precision matrix estimation challenges.
method flare package implements various regression methods and extensions for sparse precision matrix estimation.
result The flare package is efficient and scalable for large problems.