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

121242362483 · Jun 202019922001200920172026
48 results for Interpretable properties

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.

Automaton models are often seen as interpretable models. Interpretability itself is not well defined: it remains unclear what interpretability means without first explicitly specifying objectives or desired attributes. In this paper, we identify the key properties used to interpret automata and propose a modification o…

2016-11-21abs ↗pdf ↗

Develops a learning algorithm for PSL formulas from examples.

problem Learning human-interpretable descriptions of complex systems from examples.
method Reduces learning to propositional logic constraint satisfaction and uses SAT solver.
result Proposed method provides succinct human-interpretable descriptions from examples.

The paper builds interpretable models for property markets using machine learning.

problem Noise in real market data and differences from ideal data.
method Combining classical linear regression with kriging for land parcels, and RuleFit method for flats.
result Effective models can be built for property markets while maintaining interpretability.

Study geodesic properties of time series data using Wasserstein metric.

problem Modeling nonlinear time series with transport-based metrics.
method Generalized Wasserstein metric and signed cumulative distribution transforms.
result Geodesic properties provide added interpretability and robustness in time series classifiers.

BL learns interpretable optimization structures from data.

problem Learning interpretable optimization structures from data.
method BL parameterizes a compositional utility function from intrinsically interpretable modular blocks.
result BL supports architectures from single to hierarchical compositions, modeling hierarchical optimization structures.

Interpretable representations improve explainable AI by translating complex data into understandable concepts.

problem Many explainers use interpretable representations but overlook their full potential and assumptions.
method An in-depth analysis of interpretable representations for tabular, image, and text data, identifying strengths, weaknesses, and desiderata.
result Linear model quantifies interpretable concepts' influence on black-box predictions, revealing their explanatory properties and manipulability.

The ability to interpret machine learning models has become increasingly important now that machine learning is used to inform consequential decisions. We propose an approach called model extraction for interpreting complex, blackbox models. Our approach approximates the complex model using a much more interpretable mo…

2017-06-29abs ↗pdf ↗

Supervised machine learning models boast remarkable predictive capabilities. But can you trust your model? Will it work in deployment? What else can it tell you about the world? We want models to be not only good, but interpretable. And yet the task of interpretation appears underspecified. Papers provide diverse and s…

2016-06-10abs ↗pdf ↗

Generative model learns to create molecules with multiple properties using interpretable substructures.

problem Creating molecules with multiple chemical properties is challenging.
method Compose molecules from substructures identified as responsible for each property, using graph generative models.
result Significant improvements in accuracy, diversity, and novelty of generated compounds over state-of-the-art baselines.

MV-GNN improves molecular property prediction by integrating atom and bond information.

problem Accurately predicting molecular properties using graph neural networks.
method Multi-View Graph Neural Network (MV-GNN) architecture with shared self-attentive readout and cross-dependent message passing.
result MV-GNN achieves superior performance on molecular property prediction benchmarks.

Understanding why a model makes a certain prediction can be as crucial as the prediction's accuracy in many applications. However, the highest accuracy for large modern datasets is often achieved by complex models that even experts struggle to interpret, such as ensemble or deep learning models, creating a tension betw…

2017-05-22abs ↗pdf ↗

C2G-Net improves image classification of similar objects like cells.

problem Classifying images with many similar objects efficiently and interpretably.
method Combines image compression and a CNN with reduced parameters.
result C2G-Net achieves similar accuracy to conventional CNNs but with reduced training time and improved interpretability.

The notion of a Dirac submanifold of a Poisson manifold was studied by Xu (arXiv:math.SG/0110326). We give an interpretation of Xu's definition in terms of a general notion of tensor fields soldered to a normalized submanifold. Then, this interpretation is used to define Dirac submanifolds of a Jacobi manifold. Several…

2002-05-02abs ↗pdf ↗

The paper connects decision tree interpretability and robustness through separation.

problem Empirical observation of a connection between robustness and interpretability in decision trees.
method Investigation of the connection through decision trees and ll_{\infty}-perturbation robustness, proving bounds on tree size.
result First algorithm with guarantees on robustness, interpretability, and accuracy for decision trees.

GMT improves interpretability of XGNNs by approximating SubMT.

problem Limited understanding of existing interpretable subgraph learning methods.
method Formulated subgraph multilinear extension (SubMT) and designed GMT architecture.
result GMT outperforms state-of-the-art in both interpretability and generalizability.

Connections between integration along hypersufaces, Radon transforms, and neural networks are exploited to highlight an integral geometric mathematical interpretation of neural networks. By analyzing the properties of neural networks as operators on probability distributions for observed data, we show that the distribu…

2019-07-04abs ↗pdf ↗

With the rise of deep neural networks for quantum chemistry applications, there is a pressing need for architectures that, beyond delivering accurate predictions of chemical properties, are readily interpretable by researchers. Here, we describe interpretation techniques for atomistic neural networks on the example of …

2018-06-27abs ↗pdf ↗

We propose a novel interpretation of the collapsed variational Bayes inference with a zero-order Taylor expansion approximation, called CVB0 inference, for latent Dirichlet allocation (LDA). We clarify the properties of the CVB0 inference by using the alpha-divergence. We show that the CVB0 inference is composed of two…

2012-06-27abs ↗pdf ↗

New compactification for character varieties with good topological properties.

problem Compactification of character varieties with good topological properties.
method Announced a new compactification with interpretations of ideal points.
result Relates to Weyl chamber length compactification and applies to maximal and Hitchin representations.

GAMLA learns manifold structures with auto-encoding for global insights.

problem Limited global insight and lack of interpretable analytical descriptions in manifold learning.
method Two-round auto-encoding process to derive character and complementary representations.
result GAMLA provides global and analytical descriptions of smooth manifolds.

Unified approach to verify NN properties using ReLU's unique polytope structure.

problem Lack of robustness and interpretability in ReLU NNs for risk-sensitive applications.
method Identifying and traversing the local polytopes of ReLU NNs, developing an algorithm to verify properties.
result Unified approach to examine network behavior in risk-sensitive settings.

FF layers in transformers are nearly as interpretable as sparse autoencoders.

problem Comparing interpretability of feature vectors in FF layers vs. sparse autoencoders.
method Revisited interpretability of FF layers as key-value memories using modern benchmarks.
result FF and SAE feature vectors are similarly interpretable, but FFs can be better in some aspects.

NAMLSS models provide interpretable neural regression for location, scale, and shape.

problem Lack of interpretability in deep learning models for complex data distributions.
method Combines classical statistical methods with DNNs for distributional regression.
result Achieves visual interpretability and predictive power of deep learning models.

Mathematical properties of the historical GDP/cap distributions are discussed and explained. These distributions are frequently incorrectly interpreted and the Unified Growth Theory is an outstanding example of such common misconceptions. It is shown here that the fundamental postulates of this theory are contradicted …

2015-09-25abs ↗pdf ↗

A new model combines diffusion and random features for better interpretability and comparable performance.

problem Lack of theoretical justification and computational expense in diffusion models, and limited interpretability in random feature models.
method Developed a deep random feature model inspired by diffusion models, derived generalization bounds using score matching.
result The model achieves comparable performance to fully connected neural networks and provides theoretical generalization bounds.

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.

Convolutional neural networks (CNNs) are one of the driving forces for the advancement of computer vision. Despite their promising performances on many tasks, CNNs still face major obstacles on the road to achieving ideal machine intelligence. One is that CNNs are complex and hard to interpret. Another is that standard…

2017-11-22abs ↗pdf ↗

This manuscript proposes a probabilistic framework for algorithms that iteratively solve unconstrained linear problems Bx=bBx = b with positive definite BB for xx. The goal is to replace the point estimates returned by existing methods with a Gaussian posterior belief over the elements of the inverse of BB, which can …

2014-02-10abs ↗pdf ↗

Simplifies PLNNs to interpretable models for better explainability.

problem Challenges in interpretability of PLNNs for high-stakes applications.
method Trained deep network simplification and algorithm for reducing flat networks.
result Improved interpretability of PLNNs without sacrificing performance.