Attention mechanisms have been boosting the performance of deep learning models on a wide range of applications, ranging from speech understanding to program induction. However, despite experiments from psychology which suggest that attention plays an essential role in visual reasoning, the full potential of attention …
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
48 results for “Abstract Reasoning”
Constellation learns group-level visual relationships for abstract reasoning.
problem Learning configurational properties of entire groups of objects.
method Introduces Constellation, a network that learns relational abstractions over static visual scenes.
result Offers a basis for abstract relational reasoning and sensory imagination.
Whether neural networks can learn abstract reasoning or whether they merely rely on superficial statistics is a topic of recent debate. Here, we propose a dataset and challenge designed to probe abstract reasoning, inspired by a well-known human IQ test. To succeed at this challenge, models must cope with various gener…
Develops models for temporally abstract reasoning and attention.
problem Temporal abstraction and attention in reinforcement learning.
method Defines affordances for options and develops partial option models.
result Identifies trade-offs between estimation and approximation error.
MXGNet tackles visual reasoning tasks using graph neural networks.
problem Abstract reasoning, especially in the visual domain, is challenging for AI.
method Combines object-level representations, graph neural networks, and multiplex graphs.
result Achieves state-of-the-art accuracy on Euler Diagram Syllogisms and outperforms state-of-the-art models on RPM datasets.
A disentangled representation encodes information about the salient factors of variation in the data independently. Although it is often argued that this representational format is useful in learning to solve many real-world down-stream tasks, there is little empirical evidence that supports this claim. In this paper, …
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 an image preprocessing technique capable of improving the performance of few-shot classifiers on abstract visual reasoning tasks. Many visual reasoning tasks with abstract features are easy for humans to learn with few examples but very difficult for computer vision approaches with the same number of samples…
A new method learns object hierarchies from images to reason about physical interactions.
problem Learning about the interactions of complex objects and their dynamics.
method Unsupervised learning of object hierarchies from raw visual images.
result Improves over a strong baseline at modeling synthetic and real-world videos.
Graph Neural Networks align with dynamic programming, improving algorithmic reasoning.
problem Demonstrate and quantify alignment between GNNs and dynamic programming.
method Category theory and abstract algebra methods to expose intricate connection.
result Showed GNNs align with dynamic programming beyond individual algorithms.
Despite their impressive performance in many tasks, deep neural networks often struggle at relational reasoning. This has recently been remedied with the introduction of a plug-in relational module that considers relations between pairs of objects. Unfortunately, this is combinatorially expensive. In this extended abst…
LatFormer improves geometric reasoning by incorporating lattice symmetry priors in attention mechanisms.
problem State-of-the-art models struggle with geometric reasoning tasks in the ARC and LARC datasets.
method Introduced LatFormer, a model that uses lattice symmetry priors in attention masks.
result LatFormer requires 2 orders of magnitude fewer data than standard attention mechanisms.
Improving Generalization for Abstract Reasoning Tasks Using Disentangled Feature Representationscs.LG
In this work we explore the generalization characteristics of unsupervised representation learning by leveraging disentangled VAE's to learn a useful latent space on a set of relational reasoning problems derived from Raven Progressive Matrices. We show that the latent representations, learned by unsupervised training …
Mid-training improves RL by identifying compact action abstractions.
problem Unlocking full potential of RL with large language models.
method RA3 algorithm that optimizes sequential variational lower bound and discovers latent structures via RL.
result Improves performance by 8 points on HumanEval and 4 points on MBPP.
Enhances BO with expert preferences about abstract properties.
problem Lack of expert knowledge in BO for black-box experimental design.
method Human-AI collaboration to incorporate expert preferences into surrogate modeling.
result Superior performance compared to baselines in synthetic and real-world datasets.
Beyond Tabula-Rasa: a Modular Reinforcement Learning Approach for Physically Embedded 3D Sokobancs.LG
Modular RL modules solve complex 3D Sokoban tasks.
problem Solving complex, integrated tasks combining visual, physical, and abstract reasoning.
method Compose RL modules in a sense-plan-act hierarchy, using only model-free methods.
result Modular RL outperforms state-of-the-art monolithic RL on Mujoban.
Abstractor enhances Transformers for relational reasoning, improving sample efficiency and performance.
problem Improving sample efficiency and performance in relational tasks.
method Introduces Abstractor module with relational cross-attention to enable explicit relational reasoning.
result Dramatic improvements in sample efficiency and performance on various relational tasks.
This abstract extends on the previous work (arXiv:1407.2646, arXiv:1606.00075) on program induction using probabilistic programming. It describes possible further steps to extend that work, such that, ultimately, automatic probabilistic program synthesis can generalise over any reasonable set of inputs and outputs, in …
Ideal attribution mechanisms track model interactions for faithful watermarks.
problem Ensuring models provide transparent and fair attribution decisions.
method Introducing ideal attribution mechanisms and a ledger for tracking model interactions.
result A unified framework for evaluating watermarking schemes, clarifying attainable guarantees.
A new method for math reasoning that allows for iterative correction.
problem Standard reasoning models commit to each token and cannot recover from early errors.
method Generative framework with latent thought vectors for iterative self-correction.
result 30 rethinking iterations surpass baselines with 15 times more parameters.
Slot Attention extracts object-centric representations from images.
problem Learning distributed representations that don't capture natural scene composition.
method Slot Attention module interfaces with CNN outputs to produce task-dependent abstract slots.
result Slot Attention enables generalization to unseen compositions.
ManifoldMind uses adaptive-curvature probabilistic spheres for trustworthy recommendations in semantic hierarchies.
problem Sparse and abstract recommendation domains where users explore diverse conceptual paths.
method Adaptive-curvature probabilistic spheres, soft multi-hop inference, and curvature-aware semantic kernel.
result Superior NDCG, calibration, and diversity compared to baselines on public benchmarks.
Solving complex, temporally-extended tasks is a long-standing problem in reinforcement learning (RL). We hypothesize that one critical element of solving such problems is the notion of compositionality. With the ability to learn concepts and sub-skills that can be composed to solve longer tasks, i.e. hierarchical RL, w…
Improved neural networks for relational reasoning by projecting high-dimensional data to low-dimensional manifolds.
problem Out-of-distribution generalization in complex relational reasoning tasks.
method Neuroscience-inspired inductive-biased module projecting high-dimensional object representations to low-dimensional manifolds.
result Significantly better out-of-distribution generalization performance on relational reasoning tasks.
Despite remarkable advances in automated visual recognition by machines, some visual tasks remain challenging for machines. Fleuret et al. (2011) introduced the Synthetic Visual Reasoning Test (SVRT) to highlight this point, which required classification of images consisting of randomly generated shapes based on hidden…
Transfer learning which aims at utilizing knowledge learned from one problem (source domain) to solve another different but related problem (target domain) has attracted wide research attentions. However, the current transfer learning methods are mostly uninterpretable, especially to people without ML expertise. In thi…
Although deep learning models have been successfully applied to a variety of tasks, due to the millions of parameters, they are becoming increasingly opaque and complex. In order to establish trust for their widespread commercial use, it is important to formalize a principled framework to reason over these models. In t…
In this work, we consider the problem of autonomously discovering behavioral abstractions, or options, for reinforcement learning agents. We propose an algorithm that focuses on the termination condition, as opposed to -- as is common -- the policy. The termination condition is usually trained to optimize a control obj…
The study develops a logic reasoner to verify MS case management specifications.
problem Ensuring correctness and solvability of abstract clinical work products.
method Developed a logic reasoner using UML class and state diagrams, SPIN, and ODM.
result Formal representations of UML diagrams proved consistent for MS case management.
Learning transferable knowledge across similar but different settings is a fundamental component of generalized intelligence. In this paper, we approach the transfer learning challenge from a causal theory perspective. Our agent is endowed with two basic yet general theories for transfer learning: (i) a task shares a c…
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…
The problem of replicating the flexibility of human common-sense reasoning has captured the imagination of computer scientists since the early days of Alan Turing's foundational work on computation and the philosophy of artificial intelligence. In the intervening years, the idea of cognition as computation has emerged …
Graph Neural Network (GNN) research has concentrated on improving convolutional layers, with little attention paid to developing graph pooling layers. Yet pooling layers can enable GNNs to reason over abstracted groups of nodes instead of single nodes. To close this gap, we propose a graph pooling layer relying on the …
Unified model learns concepts across domains like left and right.
problem Limited generalization of language concepts in inference-only models.
method Logic-Enhanced Foundation Model (LEFT) with a differentiable, domain-independent program executor.
result LEFT flexibly learns and reasons with concepts across 2D images, 3D scenes, human motions, and robotic manipulation.
This research tackles intervention-centric causal reasoning in learning agents by using meta-learning.
problem Learning agents lack the concept of interventions, making causal learning challenging.
method A meta-reinforcement learning algorithm is used to learn causal relationships from observational data.
result The approach enables agents to learn and manipulate the environment effectively.
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.
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.
Study on HyperGNNs' expressiveness and structural generalization.
problem Understanding HyperGNNs' ability to solve graph problems and generalize to larger graphs.
method Fine-grained analysis of expressiveness and learning properties, with theoretical and empirical support.
result HyperGNNs can solve a hierarchy of graph problems defined by hyperparameters.
Humans prove theorems by relying on substantial high-level reasoning and problem-specific insights. Proof assistants offer a formalism that resembles human mathematical reasoning, representing theorems in higher-order logic and proofs as high-level tactics. However, human experts have to construct proofs manually by en…
A new layer learns abstract relations from graph structure using finite-state automata.
problem Learning abstract relations from graph structure for program analysis.
method Relaxing the problem into learning finite-state automata policies on a graph-based POMDP and training these policies using implicit differentiation.
result GFSA layer finds shortcuts in grid-world graphs and reproduces simple static analyses on Python programs.
Recent findings in multi-agent deep learning systems point towards the emergence of compositional languages. These claims are often made without exact analysis or testing of the language. In this work, we analyze the emergent language resulting from two different cooperative multi-agent game with more exact measures fo…
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 …
A number of recent approaches to policy learning in 2D game domains have been successful going directly from raw input images to actions. However when employed in complex 3D environments, they typically suffer from challenges related to partial observability, combinatorial exploration spaces, path planning, and a scarc…
Real artificial intelligence always has been focused on by many machine learning researchers, especially in the area of deep learning. However deep neural network is hard to be understood and explained, and sometimes, even metaphysics. The reason is, we believe that: the network is essentially a perceptual model. There…
LiveTradeBench evaluates LLMs in live trading environments.
problem Static benchmarks fail to assess real-world trading ability.
method Live data streaming, portfolio management abstraction, multi-market evaluation.
result LLMs show distinct portfolio styles and adapt to live signals.
TIR expands LLM capabilities by enabling problem-solving strategies.
problem Lack of a principled theory explaining why LLMs with tools are more capable.
method Formal proof and Advantage Shaping Policy Optimization (ASPO) algorithm.
result TIR model decisively outperforms pure-text models on challenging benchmarks.
KINet learns object interactions without supervision for robotic pushing.
problem Lack of supervised data for object-centric forward prediction.
method End-to-end unsupervised framework using keypoint representation and contrastive estimation.
result Automatically generalizes to unseen scenarios and accurately predicts future states.
End-to-End Deep Neural Networks and Transfer Learning for Automatic Analysis of Nation-State Malwarecs.CR
Malware allegedly developed by nation-states, also known as advanced persistent threats (APT), are becoming more common. The task of attributing an APT to a specific nation-state or classifying it to the correct APT family is challenging for several reasons. First, each nation-state has more than a single cyber unit th…