Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Arya Grayeli

dblp:359/3196 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2024
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Knowledge representation and reasoning · 22% Language models and text generation · 22% Segmentation and scene understanding · 22%
Software engineering, system software, and programming languages
1 paper
Program synthesis and code generation · 100%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation
compositional generalization
0.812024
Neurosymbolic Grounding for Compositional World Models · ICLR 2024
Knowledge, reasoning and agents › Knowledge representation and reasoning
neuro-symbolic reasoning
0.812024
Neurosymbolic Grounding for Compositional World Models · ICLR 2024
Machine learning › Reinforcement learning › model-based reinforcement learning › world model
object-centric world model
0.812024
Neurosymbolic Grounding for Compositional World Models · ICLR 2024
Computer vision › Segmentation and scene understanding
scene understanding
0.812024
Neurosymbolic Grounding for Compositional World Models · ICLR 2024
Program synthesis and code generation › inductive program synthesis
symbolic regression
0.812024
Symbolic Regression with a Learned Concept Library · NeurIPS 2024
Machine learning › Deep learning architectures and training
foundation model
0.212024
Neurosymbolic Grounding for Compositional World Models · ICLR 2024
Computer vision › Vision and language
visual grounding
0.212024
Neurosymbolic Grounding for Compositional World Models · ICLR 2024

Methods — techniques the papers use, named apart from their topics

zero-shot prompting · 0.8neuro-symbolic grounding · 0.8large language model · 0.8genetic algorithm · 0.8differentiable reasoning · 0.8attention mechanism · 0.8
YearPublicationVenuePosition
2024 Neurosymbolic Grounding for Compositional World Models
abstract
We introduce Cosmos, a framework for object-centric world modeling that is designed for compositional generalization (CompGen), i.e., high performance on unseen input scenes obtained through the composition of known visual "atoms." The central insight behind Cosmos is the use of a novel form of neurosymbolic grounding. Specifically, the framework introduces two new tools: (i) neurosymbolic scene encodings, which represent each entity in a scene using a real vector computed using a neural encoder, as well as a vector of composable symbols describing attributes of the entity, and (ii) a neurosymbolic attention mechanism that binds these entities to learned rules of interaction. Cosmos is end-to-end differentiable; also, unlike traditional neurosymbolic methods that require representations to be manually mapped to symbols, it computes an entity's symbolic attributes using vision-language foundation models. Through an evaluation that considers two different forms of CompGen on an established blocks-pushing domain, we show that the framework establishes a new state-of-the-art for CompGen in world modeling. Artifacts are available at: https://trishullab.github.io/cosmos-web/
Atharva Sehgal, Arya Grayeli, Jennifer J. Sun, Swarat Chaudhuri
ICLR2
2024 Symbolic Regression with a Learned Concept Library
abstract
We present a novel method for symbolic regression (SR), the task of searching for compact programmatic hypotheses that best explain a dataset. The problem is commonly solved using genetic algorithms; we show that we can enhance such methods by inducing a library of abstract textual concepts. Our algorithm, called LaSR, uses zero-shot queries to a large language model (LLM) to discover and evolve concepts occurring in known high-performing hypotheses. We discover new hypotheses using a mix of standard evolutionary steps and LLM-guided steps (obtained through zero-shot LLM queries) conditioned on discovered concepts. Once discovered, hypotheses are used in a new round of concept abstraction and evolution. We validate LaSR on the Feynman equations, a popular SR benchmark, as well as a set of synthetic tasks. On these benchmarks, LaSR substantially outperforms a variety of state-of-the-art SR approaches based on deep learning and evolutionary algorithms. Moreover, we show that LASR can be used to discover a new and powerful scaling law for LLMs.
Arya Grayeli, Atharva Sehgal, Omar Costilla-Reyes, Miles D. Cranmer, Swarat Chaudhuri
NeurIPS1