{"list":"other","total":52,"rows":[{"id":"2211.17192","title":"Fast Inference from Transformers via Speculative Decoding","created":"2022-11-30","cited_by_count":1653},{"id":"2106.01345","title":"Decision Transformer: Reinforcement Learning via Sequence Modeling","created":"2021-06-02","cited_by_count":1546},{"id":"1910.07467","title":"Root Mean Square Layer Normalization","created":"2019-10-16","cited_by_count":1480},{"id":"2302.01318","title":"Accelerating Large Language Model Decoding with Speculative Sampling","created":"2023-02-02","cited_by_count":1006},{"id":"1803.08475","title":"Attention, Learn to Solve Routing Problems!","created":"2018-03-22","cited_by_count":656},{"id":"1704.01665","title":"Learning Combinatorial Optimization Algorithms over Graphs","created":"2017-04-05","cited_by_count":561},{"id":"1507.06527","title":"Deep Recurrent Q-Learning for Partially Observable MDPs","created":"2015-07-23","cited_by_count":465},{"id":"2010.16011","title":"POMO: Policy Optimization with Multiple Optima for Reinforcement Learning","created":"2020-10-30","cited_by_count":348},{"id":"1811.03115","title":"Blockwise Parallel Decoding for Deep Autoregressive Models","created":"2018-11-07","cited_by_count":323},{"id":"1906.01227","title":"An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem","created":"2019-06-04","cited_by_count":269},{"id":"2003.04887","title":"ReZero is All You Need: Fast Convergence at Large Depth","created":"2020-03-10","cited_by_count":264},{"id":"2302.08224","title":"DIFUSCO: Graph-based Diffusion Solvers for Combinatorial Optimization","created":"2023-02-16","cited_by_count":221},{"id":"2405.15682","title":"The Road Less Scheduled","created":"2024-05-24","cited_by_count":163},{"id":"2012.10658","title":"Generalize a Small Pre-trained Model to Arbitrarily Large TSP Instances","created":"2020-12-19","cited_by_count":162},{"id":"2310.07985","title":"Neural Combinatorial Optimization with Heavy Decoder: Toward Large Scale Generalization","created":"2023-10-12","cited_by_count":142},{"id":"2301.07608","title":"Human-Timescale Adaptation in an Open-Ended Task Space","created":"2023-01-18","cited_by_count":138},{"id":"2012.10384","title":"Hybrid Genetic Search for the CVRP: Open-Source Implementation and SWAP* Neighborhood","created":"2020-11-23","cited_by_count":125},{"id":"2205.13209","title":"Sym-NCO: Leveraging Symmetricity for Neural Combinatorial Optimization","created":"2022-05-26","cited_by_count":119},{"id":"2402.05109","title":"Hydra: Sequentially-Dependent Draft Heads for Medusa Decoding","created":"2024-02-07","cited_by_count":117},{"id":"2107.04139","title":"Learning to Delegate for Large-scale Vehicle Routing","created":"2021-07-08","cited_by_count":109},{"id":"2110.02544","title":"Learning to Iteratively Solve Routing Problems with Dual-Aspect Collaborative Transformer","created":"2021-10-06","cited_by_count":108},{"id":"2110.07983","title":"NeuroLKH: Combining Deep Learning Model with Lin-Kernighan-Helsgaun Heuristic for Solving the Traveling Salesman Problem","created":"2021-10-15","cited_by_count":103},{"id":"2012.10638","title":"Multi-Decoder Attention Model with Embedding Glimpse for Solving Vehicle Routing Problems","created":"2020-12-19","cited_by_count":100},{"id":"2106.05126","title":"Efficient Active Search for Combinatorial Optimization Problems","created":"2021-06-09","cited_by_count":100},{"id":"2006.07054","title":"Learning the Travelling Salesperson Problem Requires Rethinking Generalization","created":"2020-06-12","cited_by_count":98},{"id":"2106.11113","title":"Matrix Encoding Networks for Neural Combinatorial Optimization","created":"2021-06-21","cited_by_count":91},{"id":"2312.08224","title":"GLOP: Learning Global Partition and Local Construction for Solving Large-scale Routing Problems in Real-time","created":"2023-12-13","cited_by_count":85},{"id":"2207.06190","title":"Simulation-guided Beam Search for Neural Combinatorial Optimization","created":"2022-07-13","cited_by_count":84},{"id":"2301.03313","title":"BQ-NCO: Bisimulation Quotienting for Efficient Neural Combinatorial Optimization","created":"2023-01-09","cited_by_count":82},{"id":"2310.18264","title":"Learning to Search Feasible and Infeasible Regions of Routing Problems with Flexible Neural k-Opt","created":"2023-10-27","cited_by_count":81},{"id":"1512.04455","title":"Memory-based control with recurrent neural networks","created":"2015-12-14","cited_by_count":78},{"id":"2306.17100","title":"RL4CO: an Extensive Reinforcement Learning for Combinatorial Optimization Benchmark","created":"2023-06-29","cited_by_count":71},{"id":"2307.03864","title":"When Do Transformers Shine in RL? Decoupling Memory from Credit Assignment","created":"2023-07-07","cited_by_count":63},{"id":"2303.10538","title":"Unsupervised Learning for Solving the Travelling Salesman Problem","created":"2023-03-19","cited_by_count":58},{"id":"2406.15007","title":"RouteFinder: Towards Foundation Models for Vehicle Routing Problems","created":"2024-06-21","cited_by_count":55},{"id":"2403.13795","title":"PyVRP: a high-performance VRP solver package","created":"2023-11-22","cited_by_count":52},{"id":"2304.09407","title":"Pointerformer: Deep Reinforced Multi-Pointer Transformer for the Traveling Salesman Problem","created":"2023-04-19","cited_by_count":50},{"id":"2406.15079","title":"GOAL: A Generalist Combinatorial Optimization Agent Learner","created":"2024-06-21","cited_by_count":42},{"id":"2503.00753","title":"Rethinking Light Decoder-based Solvers for Vehicle Routing Problems","created":"2025-03-02","cited_by_count":37},{"id":"2402.14048","title":"PolyNet: Learning Diverse Solution Strategies for Neural Combinatorial Optimization","created":"2024-02-21","cited_by_count":35},{"id":"2403.15180","title":"Self-Improvement for Neural Combinatorial Optimization: Sample without Replacement, but Improvement","created":"2024-03-22","cited_by_count":34},{"id":"2002.03282","title":"A Deep Reinforcement Learning Algorithm Using Dynamic Attention Model for Vehicle Routing Problems","created":"2020-02-09","cited_by_count":30},{"id":"2006.09100","title":"Learning to Solve Vehicle Routing Problems with Time Windows through Joint Attention","created":"2020-06-16","cited_by_count":29},{"id":"2403.19561","title":"Self-Improved Learning for Scalable Neural Combinatorial Optimization","created":"2024-03-28","cited_by_count":29},{"id":"2206.13181","title":"Learning to Control Local Search for Combinatorial Optimization","created":"2022-06-27","cited_by_count":18},{"id":"2501.03715","title":"Neural Deconstruction Search for Vehicle Routing Problems","created":"2025-01-07","cited_by_count":15},{"id":"2503.16159","title":"RRNCO: Towards Real-World Routing with Neural Combinatorial Optimization","created":"2025-03-20","cited_by_count":11},{"id":"2505.13904","title":"Learning to Insert for Constructive Neural Vehicle Routing Solver","created":"2025-05-20","cited_by_count":10},{"id":"2409.03811","title":"PARCO: Parallel AutoRegressive Models for Multi-Agent Combinatorial Optimization","created":"2024-09-05","cited_by_count":7},{"id":"2309.17089","title":"Too Big, so Fail? -- Enabling Neural Construction Methods to Solve Large-Scale Routing Problems","created":"2023-09-29","cited_by_count":6},{"id":"2402.09900","title":"Recurrent Reinforcement Learning with Memoroids","created":"2024-02-15","cited_by_count":6},{"id":"2407.17206","title":"Take a Step and Reconsider: Sequence Decoding for Self-Improved Neural Combinatorial Optimization","created":"2024-07-24","cited_by_count":4}],"next_cursor":null}