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

55109164218 · Jun 202019922001200920172026
48 results for Abstract Interpretation

CIB compresses variables causally, preserving key causal interactions.

problem Constructing causal variable abstractions in complex systems.
method Causal Information Bottleneck (CIB) method, extending IB to include causal structures.
result CIB produces causally interpretable abstractions that accurately capture causal relations.

We present a training system, which can provably defend significantly larger neural networks than previously possible, including ResNet-34 and DenseNet-100. Our approach is based on differentiable abstract interpretation and introduces two novel concepts: (i) abstract layers for fine-tuning the precision and scalabilit…

2019-03-29abs ↗pdf ↗

VQShape learns interpretable time-series representations and achieves comparable performance to specialist models.

problem Lack of interpretability in existing time-series models.
method Vector quantization of time-series data into abstracted shapes.
result VQShape achieves comparable performance to specialist models in classification tasks.

Novel framework for uncertainty quantification in neurosymbolic programs.

problem Lack of correctness guarantees in neurosymbolic programs due to machine learning model fallibility.
method Adapting conformal prediction to neurosymbolic programs using abstract interpretation.
result Framework provides probabilistic guarantees for correctness, compositionality, and structured values.

XIMP improves molecular property prediction by integrating multiple graph representations.

problem Graph neural networks struggle in data-scarce regimes and fail to surpass traditional methods.
method Cross-graph inter-message passing with multiple graph abstractions.
result XIMP outperforms state-of-the-art baselines across diverse molecular property tasks.

This work abstracts deep neural networks into concept graphs for better interpretability in medical tasks.

problem Lack of interpretability in deep learning models, especially in medical domains.
method Developed a graphical representation of medical image processing models to understand concept-based reasoning.
result Extracted a concept-level graph that reveals the decision-making process of deep learning models.

PLOT uses optimal transport to find neural site handles for causal abstraction.

problem Finding the relevant neural site for causal analysis is computationally challenging.
method PLOT employs optimal transport to localize causal variables from neural network outputs.
result PLOT efficiently finds intervention handles for causal abstraction in neural networks.

The paper certifies decision trees against evasion attacks using program analysis.

problem Vulnerability of decision tree models to evasion attacks by maliciously crafted perturbations.
method Transform decision trees into imperative programs for program analysis, leveraging abstract interpretation.
result Soundly verifies security guarantees of decision tree models, yielding minimal false positives.

Object-based approaches for learning action-conditioned dynamics has demonstrated promise for generalization and interpretability. However, existing approaches suffer from structural limitations and optimization difficulties for common environments with multiple dynamic objects. In this paper, we present a novel self-s…

2019-04-16abs ↗pdf ↗

In the quest for efficient and robust reinforcement learning methods, both model-free and model-based approaches offer advantages. In this paper we propose a new way of explicitly bridging both approaches via a shared low-dimensional learned encoding of the environment, meant to capture summarizing abstractions. We sho…

2018-09-12abs ↗pdf ↗

Temporal abstraction refers to the ability of an agent to use behaviours of controllers which act for a limited, variable amount of time. The options framework describes such behaviours as consisting of a subset of states in which they can initiate, an internal policy and a stochastic termination condition. However, mu…

2020-01-01abs ↗pdf ↗

Describes explaining neurons in deep representations using compositional logical concepts.

problem Interpreting neuron behavior in deep neural networks.
method Identifying compositional logical concepts that closely approximate neuron behavior.
result Compositional explanations provide insights into model performance and allow for adversarial example creation.

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 ↗

We introduce a variational approach to learning and inference of temporally hierarchical structure and representation for sequential data. We propose the Variational Temporal Abstraction (VTA), a hierarchical recurrent state space model that can infer the latent temporal structure and thus perform the stochastic state …

2019-10-02abs ↗pdf ↗

We give a geometric interpretation of all the mm-th elliptic integrable systems associated to a kk'-symmetric space N=G/G0N=G/G_0 (in the sense of C.L. Terng). It turns out that we have to introduce the integer mkm_{k'} defined by m_{1}=0 and m_{k'}= [(k'+1)/2]. Then the general problem splits into three cases : the prim…

2009-04-08abs ↗pdf ↗

Abstract perspective on quadratic programming for optimal portfolio allocation.

problem Optimal allocation problems in long portfolio theory.
method Using maximum principles and distinguished boundaries in reproducing kernel Hilbert spaces.
result Support of an optimal distribution lies in a variety intersecting a distinguished boundary.

Geometric representations of cycles in quandle homology theory are given in terms of colored knot diagrams. Abstract knot diagrams are generalized to diagrams with exceptional points which, when colored, correspond to degenerate cycles. Bounding chains are realized, and used to obtain equivalence moves for homologous c…

2000-06-16abs ↗pdf ↗

Paper proves neural networks can be approximated using interval bounds.

problem Verifying safety and robustness of neural networks.
method Introduces interval universal approximation (IUA) theorem for neural networks.
result Neural networks can be approximated using interval bounds for any continuous function and squashable activation functions.

Motivated by the relationship between symplectic fibrations and classical Yang-Mills theories, we study the closeness of a nn-form (n=2,3) defined on the total space of a fibration as a simple model for an abstract field theory. We introduce 2-plectic fibrations and interpret geometrically the corresponding equations …

2010-10-11abs ↗pdf ↗

We provide an interpretation of the APS index theorem of Piazza-Schick and Zeidler in terms of coarse homotopy theory. On the one hand we propose a motivic version of the boundary value problem, the index theorem, and the associated secondary invariants. On the other hand, we discuss in detail how the abstract version …

2018-06-10abs ↗pdf ↗

This work concludes a series of four papers on the foundational theory of orbifolds and stacks. We apply the abstract theory, developed in its predecessors, to orbifolds derived from manifolds. Specifically, we show how the very concrete topological base spaces associated to such orbifolds can be described and manipula…

1995-03-14abs ↗pdf ↗

Successful human-robot cooperation hinges on each agent's ability to process and exchange information about the shared environment and the task at hand. Human communication is primarily based on symbolic abstractions of object properties, rather than precise quantitative measures. A comprehensive robotic framework thus…

2017-01-23abs ↗pdf ↗

Mapper-GIN simplifies 3D point cloud classification with lightweight structure.

problem Robust 3D point cloud classification under corruption.
method Mapper algorithm for structural decomposition, GIN for graph classification.
result Mapper-GIN achieves competitive accuracy with minimal parameters.

New method interprets deep learning for causal effects, separating prognostic and moderating covariates.

problem Estimating individual causal/treatment effects under confounders.
method Deep counterfactual learning architecture for estimating CATE with interpretable score functions.
result Demonstrated improved interpretability and quantification of uncertainty in CATE estimation.

Electroencephalograms (EEG) are often contaminated by artifacts which make interpreting them more challenging for clinicians. Hence, automated artifact recognition systems have the potential to aid the clinical workflow. In this abstract, we share the first results on applying various machine learning algorithms to the…

2019-03-19abs ↗pdf ↗

Interprets how intrinsic motivation shapes behavior in RL agents.

problem Understanding how intrinsic motivation influences behavior in reinforcement learning agents.
method Analyzed five RL agents in procedurally generated environments using various interpretability techniques.
result Curiosity-driven agents exhibit broader and more dynamic attention than extrinsically motivated agents.

Neural networks are becoming increasingly prevalent in software, and it is therefore important to be able to verify their behavior. Because verifying the correctness of neural networks is extremely challenging, it is common to focus on the verification of other properties of these systems. One important property, in pa…

2019-02-15abs ↗pdf ↗

In the classical Lagrangian approach to conservation laws of gauge-natural field theories a suitable (vector) density is known to generate the so--called {\em conserved Noether currents}. It turns out that along any section of the relevant gauge--natural bundle this density is the divergence of a skew--symmetric (tenso…

2003-11-19abs ↗pdf ↗

Abstract MDPs enable strategic exploration and fast reward transfer in complex environments.

problem Challenging to learn accurate MDPs for high-dimensional states.
method Learn an abstract MDP over low-dimensional coarse states, using an abstraction function.
result Achieves superhuman performance on Pitfall! and higher reward with fewer samples.

The Backpropagation algorithm relies on the abstraction of using a neural model that gets rid of the notion of time, since the input is mapped instantaneously to the output. In this paper, we claim that this abstraction of ignoring time, along with the abrupt input changes that occur when feeding the training set, are …

2019-12-10abs ↗pdf ↗

New approach to abstract neural network representations using renormalization group.

problem Developing truly abstract representations in neural networks.
method Renormalization group approach to expand representations to encompass broader data sets.
result Representations in neural networks become more abstract as data breadth increases and depth increases.

Study investigates how simple speech sounds can form abstract categories.

problem How do abstract categories like phonemes emerge from speech exposure?
method Used modeling techniques to test Memory-Based Learning and Error-Correction Learning.
result Error-Correction Learning models can learn abstractions, identifying phone inventory and grouping.

Algorithm finds latent structure in value functions for improved reinforcement learning.

problem Finding latent structure in value functions for efficient reinforcement learning.
method Proposes a practical algorithm using two posterior distributions over state abstractions and abstract-state values.
result Substantial performance gains in multi-task settings where tasks share a common, low-dimensional representation.

Improved scalability and interpretability in training data attribution.

problem Identifying which training data drives specific behaviors, especially unintended ones.
method Leveraging interpretable structures within the model to attribute model behavior to semantic directions, not individual test examples.
result Simple probe-based attribution methods are first-order approximations of Concept Influence that achieve comparable performance while being over an order-of-magnitude faster.

Proposes new methods for interpreting document classification models.

problem Interpretation fragility of attention-based neural networks.
method Corpus-level and concept-based explanation methods using attention weights.
result Extracts semantically meaningful keywords and concepts for model predictions.

This paper develops a geometric framework for SHM using feature bundles and gauge theories.

problem Defining feature spaces in population-based SHM.
method Introduces feature bundles as sections of vector bundles over structure spaces, and uses Graph Neural Networks for feature assignment.
result Develops a mathematical framework for SHM that incorporates feature spaces and gauge theories.