{"list":"other","total":61,"rows":[{"id":"1706.03762","title":"Attention Is All You Need","created":"2017-06-12","cited_by_count":60361},{"id":"1810.04805","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","created":"2018-10-11","cited_by_count":40399},{"id":"2005.14165","title":"Language Models are Few-Shot Learners","created":"2020-05-28","cited_by_count":32419},{"id":"2010.11929","title":"An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale","created":"2020-10-22","cited_by_count":30186},{"id":"2303.08774","title":"GPT-4 Technical Report","created":"2023-03-15","cited_by_count":18396},{"id":"1910.10683","title":"Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer","created":"2019-10-23","cited_by_count":14599},{"id":"2307.09288","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","created":"2023-07-18","cited_by_count":13028},{"id":"2103.14030","title":"Swin Transformer: Hierarchical Vision Transformer using Shifted Windows","created":"2021-03-25","cited_by_count":12139},{"id":"2001.08361","title":"Scaling Laws for Neural Language Models","created":"2020-01-23","cited_by_count":6586},{"id":"1409.0473","title":"Neural Machine Translation by Jointly Learning to Align and Translate","created":"2014-09-01","cited_by_count":4548},{"id":"1810.00826","title":"How Powerful are Graph Neural Networks?","created":"2018-10-01","cited_by_count":4393},{"id":"1704.01212","title":"Neural Message Passing for Quantum Chemistry","created":"2017-04-04","cited_by_count":3487},{"id":"2403.05530","title":"Gemini 1.5: Unlocking multimodal understanding across millions of tokens of context","created":"2024-03-08","cited_by_count":3224},{"id":"2305.10601","title":"Tree of Thoughts: Deliberate Problem Solving with Large Language Models","created":"2023-05-17","cited_by_count":3211},{"id":"2203.15556","title":"Training Compute-Optimal Large Language Models","created":"2022-03-29","cited_by_count":3019},{"id":"2002.05202","title":"GLU Variants Improve Transformer","created":"2020-02-12","cited_by_count":1804},{"id":"1806.01261","title":"Relational inductive biases, deep learning, and graph networks","created":"2018-06-04","cited_by_count":1360},{"id":"2305.10403","title":"PaLM 2 Technical Report","created":"2023-05-17","cited_by_count":1162},{"id":"2112.00114","title":"Show Your Work: Scratchpads for Intermediate Computation with Language Models","created":"2021-11-30","cited_by_count":886},{"id":"2012.09699","title":"A Generalization of Transformer Networks to Graphs","created":"2020-12-17","cited_by_count":661},{"id":"1410.5401","title":"Neural Turing Machines","created":"2014-10-20","cited_by_count":644},{"id":"1704.04760","title":"In-Datacenter Performance Analysis of a Tensor Processing Unit","created":"2017-04-16","cited_by_count":618},{"id":"1912.10077","title":"Are Transformers universal approximators of sequence-to-sequence functions?","created":"2019-12-20","cited_by_count":406},{"id":"2205.09712","title":"Selection-Inference: Exploiting Large Language Models for Interpretable Logical Reasoning","created":"2022-05-19","cited_by_count":334},{"id":"2102.09544","title":"Combinatorial optimization and reasoning with graph neural networks","created":"2021-02-18","cited_by_count":268},{"id":"2310.02226","title":"Think before you speak: Training Language Models With Pause Tokens","created":"2023-10-03","cited_by_count":264},{"id":"2305.10037","title":"Can Language Models Solve Graph Problems in Natural Language?","created":"2023-05-17","cited_by_count":252},{"id":"1907.03199","title":"What graph neural networks cannot learn: depth vs width","created":"2019-07-06","cited_by_count":201},{"id":"2207.00729","title":"The Parallelism Tradeoff: Limitations of Log-Precision Transformers","created":"2022-07-02","cited_by_count":193},{"id":"2312.02783","title":"Large Language Models on Graphs: A Comprehensive Survey","created":"2023-12-05","cited_by_count":192},{"id":"2207.02505","title":"Pure Transformers are Powerful Graph Learners","created":"2022-07-06","cited_by_count":188},{"id":"2310.04560","title":"Talk like a Graph: Encoding Graphs for Large Language Models","created":"2023-10-06","cited_by_count":176},{"id":"2005.03675","title":"Machine Learning on Graphs: A Model and Comprehensive Taxonomy","created":"2020-05-07","cited_by_count":156},{"id":"2106.16213","title":"Saturated Transformers are Constant-Depth Threshold Circuits","created":"2021-06-30","cited_by_count":139},{"id":"2306.02896","title":"Representational Strengths and Limitations of Transformers","created":"2023-06-05","cited_by_count":133},{"id":"2307.03381","title":"Teaching Arithmetic to Small Transformers","created":"2023-07-07","cited_by_count":123},{"id":"2112.09992","title":"Weisfeiler and Leman go Machine Learning: The Story so far","created":"2021-12-18","cited_by_count":122},{"id":"1511.08228","title":"Neural GPUs Learn Algorithms","created":"2015-11-25","cited_by_count":121},{"id":"2301.09505","title":"Rethinking the Expressive Power of GNNs via Graph Biconnectivity","created":"2023-01-23","cited_by_count":119},{"id":"2402.05862","title":"Let Your Graph Do the Talking: Encoding Structured Data for LLMs","created":"2024-02-08","cited_by_count":118},{"id":"2211.09066","title":"Teaching Algorithmic Reasoning via In-context Learning","created":"2022-11-15","cited_by_count":112},{"id":"2202.08455","title":"Transformer for Graphs: An Overview from Architecture Perspective","created":"2022-02-17","cited_by_count":107},{"id":"2310.05845","title":"GraphLLM: Boosting Graph Reasoning Ability of Large Language Model","created":"2023-10-09","cited_by_count":107},{"id":"1410.4615","title":"Learning to Execute","created":"2014-10-17","cited_by_count":106},{"id":"2205.15659","title":"The CLRS Algorithmic Reasoning Benchmark","created":"2022-05-31","cited_by_count":106},{"id":"2206.04301","title":"Unveiling Transformers with LEGO: a synthetic reasoning task","created":"2022-06-09","cited_by_count":106},{"id":"2107.13163","title":"Statistically Meaningful Approximation: a Case Study on Approximating Turing Machines with Transformers","created":"2021-07-28","cited_by_count":102},{"id":"2105.02761","title":"Neural Algorithmic Reasoning","created":"2021-05-06","cited_by_count":94},{"id":"2204.06618","title":"Formal Language Recognition by Hard Attention Transformers: Perspectives from Circuit Complexity","created":"2022-04-13","cited_by_count":93},{"id":"2310.12397","title":"GPT-4 Doesn't Know It's Wrong: An Analysis of Iterative Prompting for Reasoning Problems","created":"2023-10-19","cited_by_count":89},{"id":"1503.01007","title":"Inferring Algorithmic Patterns with Stack-Augmented Recurrent Nets","created":"2015-03-03","cited_by_count":76},{"id":"2212.13894","title":"LAMBADA: Backward Chaining for Automated Reasoning in Natural Language","created":"2022-12-20","cited_by_count":66},{"id":"2211.03232","title":"Exponentially Improving the Complexity of Simulating the Weisfeiler-Lehman Test with Graph Neural Networks","created":"2022-11-06","cited_by_count":21},{"id":"2210.00400","title":"Systematic Generalization and Emergent Structures in Transformers Trained on Structured Tasks","created":"2022-10-02","cited_by_count":19},{"id":"2305.14250","title":"Language Models with Rationality","created":"2023-05-23","cited_by_count":15},{"id":"1306.5972","title":"Communication Steps for Parallel Query Processing","created":"2013-06-25","cited_by_count":11},{"id":"1805.03055","title":"Parallel Graph Connectivity in Log Diameter Rounds","created":"2018-05-08","cited_by_count":3},{"id":"1907.01624","title":"Efficient Circuit Simulation in MapReduce","created":"2019-07-02","cited_by_count":2},{"id":"2002.08299","title":"Massively Parallel Algorithms for Small Subgraph Counting","created":"2020-02-19","cited_by_count":2},{"id":"2001.02191","title":"Equivalence Classes and Conditional Hardness in Massively Parallel Computations","created":"2020-01-07","cited_by_count":1},{"id":"2108.04102","title":"Deterministic Massively Parallel Connectivity","created":"2021-08-09","cited_by_count":1}],"next_cursor":null}