{"list":"other","total":57,"rows":[{"id":"1706.03762","title":"Attention Is All You Need","created":"2017-06-12","cited_by_count":60361},{"id":"1512.03385","title":"Deep Residual Learning for Image Recognition","created":"2015-12-10","cited_by_count":52096},{"id":"1810.04805","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","created":"2018-10-11","cited_by_count":40399},{"id":"2103.14030","title":"Swin Transformer: Hierarchical Vision Transformer using Shifted Windows","created":"2021-03-25","cited_by_count":12139},{"id":"1801.04381","title":"MobileNetV2: Inverted Residuals and Linear Bottlenecks","created":"2018-01-13","cited_by_count":4795},{"id":"1605.07146","title":"Wide Residual Networks","created":"2016-05-23","cited_by_count":3070},{"id":"1711.05101","title":"Decoupled Weight Decay Regularization","created":"2017-11-14","cited_by_count":1831},{"id":"1606.04838","title":"Optimization Methods for Large-Scale Machine Learning","created":"2016-06-15","cited_by_count":1150},{"id":"1609.04747","title":"An overview of gradient descent optimization algorithms","created":"2016-09-15","cited_by_count":1033},{"id":"1804.04235","title":"Adafactor: Adaptive Learning Rates with Sublinear Memory Cost","created":"2018-04-11","cited_by_count":905},{"id":"1811.03962","title":"A Convergence Theory for Deep Learning via Over-Parameterization","created":"2018-11-09","cited_by_count":787},{"id":"1908.03265","title":"On the Variance of the Adaptive Learning Rate and Beyond","created":"2019-08-08","cited_by_count":772},{"id":"1309.5549","title":"Stochastic First- and Zeroth-order Methods for Nonconvex Stochastic Programming","created":"2013-09-22","cited_by_count":724},{"id":"2106.04554","title":"A Survey of Transformers","created":"2021-06-08","cited_by_count":401},{"id":"1605.07110","title":"Deep Learning without Poor Local Minima","created":"2016-05-23","cited_by_count":234},{"id":"1901.09401","title":"SGD: General Analysis and Improved Rates","created":"2019-01-27","cited_by_count":207},{"id":"1806.01811","title":"AdaGrad stepsizes: Sharp convergence over nonconvex landscapes","created":"2018-06-05","cited_by_count":182},{"id":"2003.02395","title":"A Simple Convergence Proof of Adam and Adagrad","created":"2020-03-05","cited_by_count":171},{"id":"1805.08114","title":"On the Convergence of Stochastic Gradient Descent with Adaptive Stepsizes","created":"2018-05-21","cited_by_count":156},{"id":"2006.15429","title":"Understanding Gradient Clipping in Private SGD: A Geometric Perspective","created":"2020-06-27","cited_by_count":142},{"id":"1705.09886","title":"Convergence Analysis of Two-layer Neural Networks with ReLU Activation","created":"2017-05-28","cited_by_count":137},{"id":"2002.10542","title":"Stochastic Polyak Step-size for SGD: An Adaptive Learning Rate for Fast Convergence","created":"2020-02-24","cited_by_count":137},{"id":"1905.09997","title":"Painless Stochastic Gradient: Interpolation, Line-Search, and Convergence Rates","created":"2019-05-24","cited_by_count":119},{"id":"2006.05988","title":"Random Reshuffling: Simple Analysis with Vast Improvements","created":"2020-06-10","cited_by_count":115},{"id":"2208.09632","title":"Adam Can Converge Without Any Modification On Update Rules","created":"2022-08-20","cited_by_count":114},{"id":"2304.13972","title":"Convergence of Adam Under Relaxed Assumptions","created":"2023-04-27","cited_by_count":99},{"id":"1802.03801","title":"SGD and Hogwild! Convergence Without the Bounded Gradients Assumption","created":"2018-02-11","cited_by_count":95},{"id":"1603.05643","title":"Variance Reduction for Faster Non-Convex Optimization","created":"2016-03-17","cited_by_count":72},{"id":"1510.08234","title":"From error bounds to the complexity of first-order descent methods for convex functions","created":"2015-10-28","cited_by_count":43},{"id":"2006.11773","title":"Optimal and Practical Algorithms for Smooth and Strongly Convex Decentralized Optimization","created":"2020-06-21","cited_by_count":43},{"id":"2309.02031","title":"A survey on efficient vision transformers: algorithms, techniques, and performance benchmarking","created":"2023-09-05","cited_by_count":41},{"id":"2012.08749","title":"Provable Benefits of Overparameterization in Model Compression: From Double Descent to Pruning Neural Networks","created":"2020-12-16","cited_by_count":40},{"id":"2202.04295","title":"On Almost Sure Convergence Rates of Stochastic Gradient Methods","created":"2022-02-09","cited_by_count":35},{"id":"2009.06125","title":"A Qualitative Study of the Dynamic Behavior for Adaptive Gradient Algorithms","created":"2020-09-14","cited_by_count":33},{"id":"2102.06704","title":"Proximal and Federated Random Reshuffling","created":"2021-02-12","cited_by_count":33},{"id":"1502.02846","title":"Probabilistic Line Searches for Stochastic Optimization","created":"2015-02-10","cited_by_count":29},{"id":"1908.10525","title":"Linear Convergence of Adaptive Stochastic Gradient Descent","created":"2019-08-28","cited_by_count":29},{"id":"1510.08562","title":"Convergence Rate of Incremental Gradient and Newton Methods","created":"2015-10-29","cited_by_count":27},{"id":"1312.5799","title":"Accelerated, Parallel and Proximal Coordinate Descent","created":"2013-12-20","cited_by_count":25},{"id":"1310.2059","title":"Distributed Coordinate Descent Method for Learning with Big Data","created":"2013-10-08","cited_by_count":23},{"id":"2305.12475","title":"Two Sides of One Coin: the Limits of Untuned SGD and the Power of Adaptive Methods","created":"2023-05-21","cited_by_count":23},{"id":"2308.06058","title":"Adaptive SGD with Polyak stepsize and Line-search: Robust Convergence and Variance Reduction","created":"2023-08-11","cited_by_count":23},{"id":"1506.02081","title":"On the Convergence Rate of Incremental Aggregated Gradient Algorithms","created":"2015-06-05","cited_by_count":21},{"id":"1808.03045","title":"Accelerated Bregman Proximal Gradient Methods for Relatively Smooth Convex Optimization","created":"2018-08-09","cited_by_count":20},{"id":"2106.04469","title":"Lower Bounds and Optimal Algorithms for Smooth and Strongly Convex Decentralized Optimization Over Time-Varying Networks","created":"2021-06-08","cited_by_count":19},{"id":"2101.04968","title":"Learning with Gradient Descent and Weakly Convex Losses","created":"2021-01-13","cited_by_count":16},{"id":"2110.04926","title":"Convergence of Random Reshuffling Under The Kurdyka-{\\L}ojasiewicz Inequality","created":"2021-10-10","cited_by_count":16},{"id":"1903.11991","title":"Parabolic Approximation Line Search for DNNs","created":"2019-03-28","cited_by_count":14},{"id":"2209.14827","title":"On the Convergence of AdaGrad(Norm) on $\\R^{d}$: Beyond Convexity, Non-Asymptotic Rate and Acceleration","created":"2022-09-29","cited_by_count":13},{"id":"1611.00347","title":"Surpassing Gradient Descent Provably: A Cyclic Incremental Method with Linear Convergence Rate","created":"2016-11-01","cited_by_count":12},{"id":"1608.01713","title":"Global Convergence Rate of Proximal Incremental Aggregated Gradient Methods","created":"2016-08-04","cited_by_count":11},{"id":"1810.11344","title":"Benefits of over-parameterization with EM","created":"2018-10-26","cited_by_count":10},{"id":"1703.00788","title":"A Robust Adaptive Stochastic Gradient Method for Deep Learning","created":"2017-03-02","cited_by_count":5},{"id":"2402.02951","title":"Dynamic Byzantine-Robust Learning: Adapting to Switching Byzantine Workers","created":"2024-02-05","cited_by_count":5},{"id":"2103.17132","title":"Empirically explaining SGD from a line search perspective","created":"2021-03-31","cited_by_count":2},{"id":"2203.01647","title":"Complexity of a Class of First-Order Objective-Function-Free Optimization Algorithms","created":"2022-03-03","cited_by_count":1},{"id":"2307.15775","title":"CMA Light: a novel Minibatch Algorithm for large-scale non convex finite sum optimization","created":"2023-07-28","cited_by_count":1}],"next_cursor":null}