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

111223334445 · Jun 202019922001200920172026
48 results for Interpretable solutions

We propose to use boosted regression trees as a way to compute human-interpretable solutions to reinforcement learning problems. Boosting combines several regression trees to improve their accuracy without significantly reducing their inherent interpretability. Prior work has focused independently on reinforcement lear…

2018-09-19abs ↗pdf ↗

In recent years, deep learning researchers have focused on how to find the interpretability behind deep learning models. However, today cognitive competence of human has not completely covered the deep learning model. In other words, there is a gap between the deep learning model and the cognitive mode. How to evaluate…

2018-11-19abs ↗pdf ↗

Meta-learning approach to learn interpretable models from human feedback.

problem Tackling the challenge of making machine learning models interpretable.
method A meta-learning approach where a model of non-trivial proxies of human interpretability is learned from human feedback, then incorporated into the ML training process to optimize for interpretability.
result The approach leads to formulas that are either significantly more or equally accurate while being more interpretable.

Interpretable framework evaluates structure learning methods for causal discovery from observational data.

problem Evaluation of structure learning methods under assumption violations in causal discovery.
method Six-dimensional evaluation metric (DOS) tailored for causal discovery.
result Amortized causal discovery delivers results with high proximity to the optimal solution.

Model-agnostic interpretation methods can mislead if not used carefully.

problem Misinterpretation of machine learning models due to improper use of techniques.
method General pitfalls of model-agnostic interpretation methods.
result Many pitfalls exist when using global interpretation techniques for machine learning models.

Recent results using inverse scattering techniques interpret every solution φ(x,y)φ(x,y) of the sine-Gordon equation as a non-linear superposition of solutions along the axes x=0x=0 and y=0y=0. Here we provide a geometric method of integration, as well as a geometric interpretation. Specifically, every weakly regular surface…

2003-07-20abs ↗pdf ↗

A new principle minimizes residual and introduces momentum to improve PDE solution dynamics.

problem Ill-conditioning in Dirac-Frenkel residual minimization leads to non-unique parameter dynamics.
method Introduces a history variable (momentum) to select better-conditioned parameter velocities, preserving residual minimization while promoting smooth parameter evolutions.
result The approach leads to increased robustness in singular and near-singular PDE solution regimes.

In recent years, machine learning researchers have focused on methods to construct flexible and interpretable prediction models. However, an interpretability evaluation, a relationship between generalization performance and an interpretability of the model and a method for improving the interpretability have to be cons…

2018-11-21abs ↗pdf ↗

This paper presents an automated approach for interpretable feature recommendation for solving signal data analytics problems. The method has been tested by performing experiments on datasets in the domain of prognostics where interpretation of features is considered very important. The proposed approach is based on Wi…

2017-11-06abs ↗pdf ↗

Interpretability of ML models improves healthcare decisions.

problem Ensuring machine learning models are understandable for healthcare users.
method Classifying interpretability into local and global approaches, and model-specific vs. model-agnostic methods.
result Examples of practical interpretability in healthcare, including prediction and treatment optimization.

As the use of black-box models becomes ubiquitous in high stake decision-making systems, demands for fair and interpretable models are increasing. While it has been shown that interpretable models can be as accurate as black-box models in several critical domains, existing fair classification techniques that are interp…

2019-09-09abs ↗pdf ↗

The paper studies how neural policies can be interpreted using decision trees.

problem Understanding how machine learning controllers make decisions in complex environments.
method The approach involves disentangled representation using decision trees to interpret neural policies.
result The paper shows that disentanglement of learned neural dynamics improves interpretability.

Recently, Mahoney and Orecchia demonstrated that popular diffusion-based procedures to compute a quick \emph{approximation} to the first nontrivial eigenvector of a data graph Laplacian \emph{exactly} solve certain regularized Semi-Definite Programs (SDPs). In this paper, we extend that result by providing a statistica…

2011-10-08abs ↗pdf ↗

Paper proposes an efficient method to optimize neural networks without backpropagation.

problem Computational inefficiency and scalability issues in neural network optimization.
method Derives explicit solutions to optimize neural networks, reducing computational costs.
result Explicit solutions achieve near-optimality and can discover better optima than backpropagation.

IMPACC improves consensus clustering for bioinformatics data.

problem Consensus clustering's inefficiency and lack of interpretability for large-scale data.
method Ensemble minipatch co-occurrences, adaptive sampling of observations and features.
result Significantly improved accuracy and interpretability with substantial computational savings.

Selective neural network improves credit risk prediction while maintaining interpretability.

problem Improving credit risk prediction accuracy while maintaining interpretability for financial regulators.
method Introducing a neural network with a selective option to distinguish between linear and non-linear datasets.
result For most datasets, logistic regression is sufficient and interpretable, while for specific data portions, a shallow neural network model provides better accuracy.

Algorithm identifies intended fairness constraints from expert demonstrations for fair clustering.

problem Fair clustering challenges due to incomplete fairness constraints.
method Algorithm identifies fairness metric from expert demonstrations and generates clusters.
result Algorithm identifies and generates fair clusters from limited expert demonstrations.

It is commonly believed that increasing the interpretability of a machine learning model may decrease its predictive power. However, inspecting input-output relationships of those models using visual analytics, while treating them as black-box, can help to understand the reasoning behind outcomes without sacrificing pr…

2016-06-17abs ↗pdf ↗

The paper formalizes feature attribution to address inconsistent definitions and evaluate methods.

problem Inconsistent definitions of feature relevance in feature attribution.
method Formalization based on relaxed functional dependence, extended to instance-wise setting.
result State-of-the-art methods often fail to verify necessary properties for candidate selection.

We introduce the localized Lasso, which is suited for learning models that are both interpretable and have a high predictive power in problems with high dimensionality dd and small sample size nn. More specifically, we consider a function defined by local sparse models, one at each data point. We introduce sample-wis…

2016-03-22abs ↗pdf ↗

Framework for interpreting ML models to reveal properties of real-world phenomena.

problem Lack of direct interpretability in modern ML models hinders scientific understanding.
method Developed 'property descriptors' grounded in statistical learning theory.
result Property descriptors can reveal relevant properties of joint probability distributions.

An important feature of successful supervised machine learning applications is to be able to explain the predictions given by the regression or classification model being used. However, most state-of-the-art models that have good predictive power lead to predictions that are hard to interpret. Thus, several model-agnos…

2019-10-11abs ↗pdf ↗

We study the problem of subspace tracking in the presence of missing data (ST-miss). In recent work, we studied a related problem called robust ST. In this work, we show that a simple modification of our robust ST solution also provably solves ST-miss and robust ST-miss. To our knowledge, our result is the first `compl…

2018-10-06abs ↗pdf ↗

New approach interprets Nyström for kernel machines with geometric insight.

problem No comparative study over Nyström-based kernel machine approaches.
method Developed a new approach with geometric interpretation, showing equivalence to existing methods.
result Proposed approach offers insights into approximation errors and accuracy.

In this paper we continue investigation of the constant astigmatism equation z_{yy} + (1/z)_{xx} + 2 = 0. We newly interpret its solutions as describing spherical orthogonal equiareal patterns, with relevance to two-dimensional plasticity. We show how the classical Bianchi superposition principle for the sine-Gordon eq…

2012-06-01abs ↗pdf ↗

We revisit the task of learning a Euclidean metric from data. We approach this problem from first principles and formulate it as a surprisingly simple optimization problem. Indeed, our formulation even admits a closed form solution. This solution possesses several very attractive properties: (i) an innate geometric app…

2016-07-18abs ↗pdf ↗

There has been growing recent interest in probabilistic interpretations of kernel-based methods as well as learning in Banach spaces. The absence of a useful Lebesgue measure on an infinite-dimensional reproducing kernel Hilbert space is a serious obstacle for such stochastic models. We propose an estimation model for …

2013-10-17abs ↗pdf ↗

New deep learning model interprets tabular data with variable selection and explainability.

problem Deep learning models lack interpretability and variable selection.
method Proposes a new network architecture that combines deep learning with generalized linear models.
result The model provides superior predictive power and interpretable results.

SG-PALM learns interpretable tensor models for high-dimensional data.

problem Learning interpretable tensor models for high-dimensional data.
method SG-PALM combines Sylvester generative model and fast proximal alternating linearized minimization.
result SG-PALM converges linearly to global optimum and scales to high dimensions.