Optimizing compilers, as well as other translator systems, often work by rewriting expressions according to equivalence preserving rules. Given an input expression and its optimized form, finding the sequence of rules that were applied is a non-trivial task. Most of the time, the tools provide no proof, of any kind, of the equivalence between the original expression and its optimized form. In this work, we propose to reconstruct proofs of equivalence of simple mathematical expressions, after the fact, by finding paths of equivalence preserving transformations between expressions. We propose to find those sequences of transformations using a search algorithm, guided by a neural network heuristic. Using a Tree-LSTM recursive neural network, we learn a distributed representation of expressions where the Manhattan distance between vectors approximately corresponds to the rewrite distance between expressions. We then show how the neural network can be efficiently used to search for transformation paths, leading to substantial gain in speed compared to an uninformed exhaustive search. In one of our experiments, our neural-network guided search algorithm is able to solve more instances with a 2 seconds timeout per instance than breadth-first search does with a 5 minutes timeout per instance.
GC-MoE: Genomics-Guided Cell-Type-Specific Mixture of Experts for Histology-Based Single-Cell Spatial Transcriptomics
Kyushu University(九州大学);German Research Center for Artificial Intelligence (DFKI GmbH)(德国人工智能研究中心);RPTU University Kaiserslautern-Landau(科布伦茨-劳恩堡大学);The University of Osaka(大阪大学);IntelligentX GmbH;Osaka Metropolitan University(大阪 Metropolitan 大学)
A Neural-Guided Dynamic Symbolic Network for Exploring Mathematical Expressions from Data
AnnLab(安澜实验室);Institute of Semiconductors, Chinese Academy of Sciences(中国科学院半导体研究所);University of Chinese Academy of Sciences(中国科学院大学);Beijing Key Laboratory of Semiconductor Neural Network Intelligent Sensing and Computing Technology(北京市半导体神经网络智能感知与计算重点实验室);Center of Materials Science and Optoelectronics Engineering, University of Chinese Academy of Sciences(中国科学院大学材料科学与光电技术学院)
Hierarchical and Permutation-Invariant Feature Transformation Learning via Policy-Guided Embedding Search
University of Kansas(堪萨斯大学);Southwest University of Finance and Economics(西南财经大学);University of Wisconsin–Madison(威斯康星大学麦迪逊分校);University of Auckland(奥克兰大学);Arizona State University(亚利桑那州立大学);Northeast Normal University(东北师范大学)
Don't Reinvent the Wheel: Efficient Instruction-Following Text Embedding based on Guided Space Transformation
State Key Lab of CAD&CG(CAD与CG国家重点实验室);School of Computing(计算机学院);National University of Singapore(新加坡国立大学);School of Intelligence Science and Engineering(智能科学与工程学院);Harbin Institute of Technology (Shenzhen)(哈尔滨工业大学(深圳))
MaPPER: Multimodal Prior-guided Parameter Efficient Tuning for Referring Expression Comprehension
College of Systems Engineering, National University of Defense Technology(系统工程学院,国防科技大学);Tsinghua University(清华大学);Hefei University of Technology(合肥工业大学);iFLYTEK Research(iFLYTEK研究院)