{"list":"other","total":67,"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":"2103.00020","title":"Learning Transferable Visual Models From Natural Language Supervision","created":"2021-02-26","cited_by_count":33744},{"id":"2005.14165","title":"Language Models are Few-Shot Learners","created":"2020-05-28","cited_by_count":32419},{"id":"2112.10752","title":"High-Resolution Image Synthesis with Latent Diffusion Models","created":"2021-12-20","cited_by_count":18863},{"id":"2204.06125","title":"Hierarchical Text-Conditional Image Generation with CLIP Latents","created":"2022-04-13","cited_by_count":6585},{"id":"2204.02311","title":"PaLM: Scaling Language Modeling with Pathways","created":"2022-04-05","cited_by_count":5326},{"id":"2205.01068","title":"OPT: Open Pre-trained Transformer Language Models","created":"2022-05-02","cited_by_count":3512},{"id":"1706.02677","title":"Accurate, Large Minibatch SGD: Training ImageNet in 1 Hour","created":"2017-06-08","cited_by_count":1492},{"id":"1609.04836","title":"On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minima","created":"2016-09-15","cited_by_count":1352},{"id":"1905.05950","title":"BERT Rediscovers the Classical NLP Pipeline","created":"2019-05-15","cited_by_count":1059},{"id":"2102.12452","title":"Probing Classifiers: Promises, Shortcomings, and Advances","created":"2021-02-24","cited_by_count":876},{"id":"1710.10345","title":"The Implicit Bias of Gradient Descent on Separable Data","created":"2017-10-27","cited_by_count":655},{"id":"1807.03819","title":"Universal Transformers","created":"2018-07-10","cited_by_count":647},{"id":"1909.03368","title":"Designing and Interpreting Probes with Control Tasks","created":"2019-09-08","cited_by_count":640},{"id":"1912.10077","title":"Are Transformers universal approximators of sequence-to-sequence functions?","created":"2019-12-20","cited_by_count":406},{"id":"1905.13655","title":"Implicit Regularization in Deep Matrix Factorization","created":"2019-05-31","cited_by_count":405},{"id":"1906.05890","title":"Gradient Descent Maximizes the Margin of Homogeneous Neural Networks","created":"2019-06-13","cited_by_count":320},{"id":"1705.08741","title":"Train longer, generalize better: closing the generalization gap in large batch training of neural networks","created":"2017-05-24","cited_by_count":279},{"id":"2002.04486","title":"Implicit Bias of Gradient Descent for Wide Two-layer Neural Networks Trained with the Logistic Loss","created":"2020-02-11","cited_by_count":268},{"id":"1906.04284","title":"Analyzing the Structure of Attention in a Transformer Language Model","created":"2019-06-07","cited_by_count":243},{"id":"2110.10090","title":"Inductive Biases and Variable Creation in Self-Attention Mechanisms","created":"2021-10-19","cited_by_count":144},{"id":"2110.15343","title":"Scatterbrain: Unifying Sparse and Low-rank Attention Approximation","created":"2021-10-28","cited_by_count":130},{"id":"2105.15134","title":"Toward Understanding the Feature Learning Process of Self-supervised Contrastive Learning","created":"2021-05-31","cited_by_count":119},{"id":"2206.04301","title":"Unveiling Transformers with LEGO: a synthetic reasoning task","created":"2022-06-09","cited_by_count":106},{"id":"2105.11115","title":"Self-Attention Networks Can Process Bounded Hierarchical Languages","created":"2021-05-24","cited_by_count":105},{"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":"2302.13214","title":"Fast Attention Requires Bounded Entries","created":"2023-02-26","cited_by_count":102},{"id":"1810.07896","title":"Solving Linear Programs in the Current Matrix Multiplication Time","created":"2018-10-18","cited_by_count":100},{"id":"1706.07068","title":"CAN: Creative Adversarial Networks, Generating \"Art\" by Learning About Styles and Deviating from Style Norms","created":"2017-06-21","cited_by_count":96},{"id":"2006.09286","title":"On the Computational Power of Transformers and its Implications in Sequence Modeling","created":"2020-06-16","cited_by_count":85},{"id":"2204.13807","title":"A very preliminary analysis of DALL-E 2","created":"2022-04-25","cited_by_count":82},{"id":"1905.10961","title":"Fast Convergence of Natural Gradient Descent for Overparameterized Neural Networks","created":"2019-05-27","cited_by_count":76},{"id":"2112.00029","title":"Pixelated Butterfly: Simple and Efficient Sparse training for Neural Network Models","created":"2021-11-30","cited_by_count":76},{"id":"2112.07628","title":"Training Multi-Layer Over-Parametrized Neural Network in Subquadratic Time","created":"2021-12-14","cited_by_count":62},{"id":"2006.11648","title":"Training (Overparametrized) Neural Networks in Near-Linear Time","created":"2020-06-20","cited_by_count":58},{"id":"2302.02451","title":"KDEformer: Accelerating Transformers via Kernel Density Estimation","created":"2023-02-05","cited_by_count":58},{"id":"2004.04250","title":"An Improved Cutting Plane Method for Convex Optimization, Convex-Concave Games and its Applications","created":"2020-04-08","cited_by_count":57},{"id":"2010.05846","title":"A Refined Laser Method and Faster Matrix Multiplication","created":"2020-10-12","cited_by_count":56},{"id":"1905.04447","title":"Solving Empirical Risk Minimization in the Current Matrix Multiplication Time","created":"2019-05-11","cited_by_count":53},{"id":"2009.10217","title":"A Faster Interior Point Method for Semidefinite Programming","created":"2020-09-21","cited_by_count":53},{"id":"2010.04303","title":"How Can Self-Attention Networks Recognize Dyck-n Languages?","created":"2020-10-09","cited_by_count":51},{"id":"2304.10411","title":"Attention Scheme Inspired Softmax Regression","created":"2023-04-20","cited_by_count":49},{"id":"2007.02876","title":"A Mathematical Theory of Attention","created":"2020-07-06","cited_by_count":46},{"id":"2303.16504","title":"An Over-parameterized Exponential Regression","created":"2023-03-29","cited_by_count":45},{"id":"2004.07470","title":"Faster Dynamic Matrix Inverse for Faster LPs","created":"2020-04-16","cited_by_count":44},{"id":"2303.15725","title":"Solving Regularized Exp, Cosh and Sinh Regression Problems","created":"2023-03-28","cited_by_count":44},{"id":"1910.11957","title":"A Deterministic Linear Program Solver in Current Matrix Multiplication Time","created":"2019-10-25","cited_by_count":42},{"id":"2304.13276","title":"The Closeness of In-Context Learning and Weight Shifting for Softmax Regression","created":"2023-04-26","cited_by_count":41},{"id":"1905.11675","title":"Gram-Gauss-Newton Method: Learning Overparameterized Neural Networks for Regression Problems","created":"2019-05-28","cited_by_count":40},{"id":"2103.07601","title":"Approximating How Single Head Attention Learns","created":"2021-03-13","cited_by_count":38},{"id":"2304.02207","title":"Algorithm and Hardness for Dynamic Attention Maintenance in Large Language Models","created":"2023-04-05","cited_by_count":37},{"id":"2304.04397","title":"Randomized and Deterministic Attention Sparsification Algorithms for Over-parameterized Feature Dimension","created":"2023-04-10","cited_by_count":37},{"id":"2211.06033","title":"A Faster Small Treewidth SDP Solver","created":"2022-11-11","cited_by_count":36},{"id":"2305.00660","title":"An Iterative Algorithm for Rescaled Hyperbolic Functions Regression","created":"2023-05-01","cited_by_count":35},{"id":"2101.08208","title":"Solving SDP Faster: A Robust IPM Framework and Efficient Implementation","created":"2021-01-20","cited_by_count":33},{"id":"1712.09473","title":"Sketching for Kronecker Product Regression and P-splines","created":"2017-12-27","cited_by_count":29},{"id":"2011.05365","title":"A Nearly-Linear Time Algorithm for Linear Programs with Small Treewidth: A Multiscale Representation of Robust Central Path","created":"2020-11-10","cited_by_count":29},{"id":"2211.14407","title":"Faster Algorithm for Structured John Ellipsoid Computation","created":"2022-11-26","cited_by_count":28},{"id":"2305.04701","title":"Differentially Private Attention Computation","created":"2023-05-08","cited_by_count":25},{"id":"2208.04508","title":"Training Overparametrized Neural Networks in Sublinear Time","created":"2022-08-09","cited_by_count":22},{"id":"2210.12468","title":"Discrepancy Minimization in Input-Sparsity Time","created":"2022-10-22","cited_by_count":22},{"id":"2002.02304","title":"Solving Tall Dense Linear Programs in Nearly Linear Time","created":"2020-02-06","cited_by_count":21},{"id":"2102.12238","title":"Inductive Bias of Multi-Channel Linear Convolutional Networks with Bounded Weight Norm","created":"2021-02-24","cited_by_count":18},{"id":"2304.03426","title":"Convex Minimization with Integer Minima in $\\widetilde O(n^4)$ Time","created":"2023-04-07","cited_by_count":12},{"id":"2202.08489","title":"A Faster Interior-Point Method for Sum-of-Squares Optimization","created":"2022-02-17","cited_by_count":7},{"id":"2010.13888","title":"Unifying Matrix Data Structures: Simplifying and Speeding up Iterative Algorithms","created":"2020-10-26","cited_by_count":4}],"next_cursor":null}