arXiv AI By Pin-Yen Huang, Sachin Chhabra, Prasanth Sai Gouripeddi, Abhinav Kumar, Baoxin Li

RecipeNet: A Hierarchical Transformer for Recipe Data

Read the original on arXiv AI →

arXiv:2608. 14505v1 Announce Type: cross Abstract: Recipe data arises in domains such as materials synthesis, pharmaceutical formulation, and industrial manufacturing, where procedures are represented as ordered sequences of steps containing heterogeneous structured fields.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv Machine Learning
Aug 27

A General-Purpose Framework for Chemical Reaction Representation with Atomic Correspondence and Flexible Condition Adaptation

The paper introduces Align-React, a chemical reaction representation learning framework that incorporates atomic correspondence between reactants and products, an adapter for embedding reaction conditions, and a Reaction-Center-Aware attention mechanism. These components enable the model to capture precise molecular transformations and focus on critical functional groups, leading to improved performance across a variety of organic reaction tasks. The framework outperforms existing architectures on most benchmark datasets.

By Kaipeng Zeng, Xianbin Liu, Yu Zhang, Xiaokang Yang, Yaohui Jin, Yanyan Xu
arXiv Machine Learning
Jul 15

Hierarchical Synthetic Tabular Data Generation: A Hybrid Top-Down and Bottom-Up Framework

arXiv:2605. 28198v2 Announce Type: replace Abstract: Existing approaches for synthetic tabular data generation are based on either purely generative models or LLMs, both of which struggle with data heterogeneity, logical consistency, rare-event coverage, and robustness in low-data regimes.

By Junfeng Nie, Alvin Jin, Xiaohui Chen
arXiv Machine Learning
1d ago

RelICL: Training-free Relational Learning with Tabular Foundation Models

RelICL: Training-free Relational Learning with Tabular Foundation Models proposes a new method for relational learning that addresses two key issues of deep feature synthesis—feature explosion and interaction blindness—by propagating and fusing information step by step through the schema graph using a tabular foundation model. The approach retains the benefits of DFS while improving scalability and performance. Experiments on RelBench tasks show that RelICL performs on par with the strongest DFS-based approach.

By Simon Forbat, Rainer Gemulla