The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications at "COLT"( http://dblp.L3S.de/Venues/COLT )

URL (DBLP): http://dblp.uni-trier.de/db/conf/colt

Publication years (Num. hits)
1988 (32) 1989 (27) 1990 (37) 1991 (36) 1992 (49) 1993 (56) 1994 (40) 1995 (57) 1996 (38) 1997 (36) 1998 (33) 1999 (37) 2000 (35) 2002 (28) 2003 (61) 2004 (47) 2005 (49) 2006 (49) 2007 (49) 2008 (52) 2009 (45) 2010 (49) 2011 (44) 2012 (52) 2013 (52) 2014 (62) 2015 (78) 2016 (71) 2017 (77) 2018 (95) 2019 (128) 2020 (127) 2021 (141) 2022 (156) 2023 (171)
Publication types (Num. hits)
inproceedings(2162) proceedings(34)
Venues (Conferences, Journals, ...)
COLT(2196)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 24 occurrences of 24 keywords

Results
Found 2196 publication records. Showing 2196 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Sami Davies, Miklós Z. Rácz, Cyrus Rashtchian Reconstructing Trees from Traces. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Michal Derezinski, Kenneth L. Clarkson, Michael W. Mahoney, Manfred K. Warmuth Minimax experimental design: Bridging the gap between statistical and worst-case approaches to least squares regression. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Vitaly Feldman, Jan Vondrák High probability generalization bounds for uniformly stable algorithms with nearly optimal rate. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Constantinos Daskalakis, Themis Gouleakis, Christos Tzamos, Manolis Zampetakis Computationally and Statistically Efficient Truncated Regression. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Daniele Calandriello, Luigi Carratino, Alessandro Lazaric, Michal Valko, Lorenzo Rosasco Gaussian Process Optimization with Adaptive Sketching: Scalable and No Regret. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Yuval Dagan, Constantinos Daskalakis, Nishanth Dikkala, Siddhartha Jayanti Learning from Weakly Dependent Data under Dobrushin's Condition. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Vaggos Chatziafratis, Tim Roughgarden, Joshua R. Wang On the Computational Power of Online Gradient Descent. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Mark Braverman, Jieming Mao, Jon Schneider, S. Matthew Weinberg Multi-armed Bandit Problems with Strategic Arms. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Rong Ge 0001, Zhize Li, Weiyao Wang 0001, Xiang Wang 0011 Stabilized SVRG: Simple Variance Reduction for Nonconvex Optimization. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Matthew S. Brennan, Guy Bresler, Wasim Huleihel Universality of Computational Lower Bounds for Submatrix Detection. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Anindya De, Elchanan Mossel, Joe Neeman Is your function low dimensional? Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Andreas Maurer, Massimiliano Pontil Uniform concentration and symmetrization for weak interactions. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Yair Carmon, John C. Duchi, Aaron Sidford, Kevin Tian A Rank-1 Sketch for Matrix Multiplicative Weights. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Yeshwanth Cherapanamjeri, Nicolas Flammarion, Peter L. Bartlett Fast Mean Estimation with Sub-Gaussian Rates. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Alina Beygelzimer, Daniel Hsu 0001 (eds.) Conference on Learning Theory, COLT 2019, 25-28 June 2019, Phoenix, AZ, USA Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Blake E. Woodworth, Nathan Srebro Open Problem: The Oracle Complexity of Convex Optimization with Limited Memory. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Michael B. Cohen, Ben Cousins, Yin Tat Lee, Xin Yang 0017 A near-optimal algorithm for approximating the John Ellipsoid. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Geoffrey Wolfer, Aryeh Kontorovich Estimating the Mixing Time of Ergodic Markov Chains. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Anupam Gupta 0001, Tomer Koren, Kunal Talwar Better Algorithms for Stochastic Bandits with Adversarial Corruptions. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Lijun Zhang 0005, Zhi-Hua Zhou Stochastic Approximation of Smooth and Strongly Convex Functions: Beyond the $O(1/T)$ Convergence Rate. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Laurent Massoulié, Ludovic Stephan, Don Towsley Planting trees in graphs, and finding them back. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Christina Göpfert, Shai Ben-David, Olivier Bousquet, Sylvain Gelly, Ilya O. Tolstikhin, Ruth Urner When can unlabeled data improve the learning rate? Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Damian Straszak, Nisheeth K. Vishnoi Maximum Entropy Distributions: Bit Complexity and Stability. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Yun Kuen Cheung, Georgios Piliouras Vortices Instead of Equilibria in MinMax Optimization: Chaos and Butterfly Effects of Online Learning in Zero-Sum Games. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Ohad Shamir Exponential Convergence Time of Gradient Descent for One-Dimensional Deep Linear Neural Networks. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Alexander V. Gasnikov, Pavel E. Dvurechensky, Eduard Gorbunov, Evgeniya A. Vorontsova, Daniil Selikhanovych, César A. Uribe, Bo Jiang 0007, Haoyue Wang, Shuzhong Zhang, Sébastien Bubeck, Qijia Jiang, Yin Tat Lee, Yuanzhi Li, Aaron Sidford Near Optimal Methods for Minimizing Convex Functions with Lipschitz $p$-th Derivatives. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Sébastien Bubeck, Yuanzhi Li, Haipeng Luo, Chen-Yu Wei Improved Path-length Regret Bounds for Bandits. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Arun Sai Suggala, Kush Bhatia, Pradeep Ravikumar, Prateek Jain 0002 Adaptive Hard Thresholding for Near-optimal Consistent Robust Regression. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Victor-Emmanuel Brunel Learning rates for Gaussian mixtures under group action. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Peter Auer, Pratik Gajane, Ronald Ortner Adaptively Tracking the Best Bandit Arm with an Unknown Number of Distribution Changes. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Yingjie Fei, Yudong Chen 0001 Achieving the Bayes Error Rate in Stochastic Block Model by SDP, Robustly. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Vitaly Feldman, Roy Frostig, Moritz Hardt Open Problem: How fast can a multiclass test set be overfit? Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Christian Coester, James R. Lee Pure entropic regularization for metrical task systems. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Zakaria Mhammedi, Wouter M. Koolen, Tim van Erven Lipschitz Adaptivity with Multiple Learning Rates in Online Learning. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Andreas Anastasiou, Krishnakumar Balasubramanian 0002, Murat A. Erdogdu Normal Approximation for Stochastic Gradient Descent via Non-Asymptotic Rates of Martingale CLT. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Maryam Aliakbarpour, Ravi Kumar 0001, Ronitt Rubinfeld Testing Mixtures of Discrete Distributions. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Ulysse Marteau-Ferey, Dmitrii Ostrovskii, Francis R. Bach, Alessandro Rudi Beyond Least-Squares: Fast Rates for Regularized Empirical Risk Minimization through Self-Concordance. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Dylan J. Foster, Andrej Risteski Sum-of-squares meets square loss: Fast rates for agnostic tensor completion. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Adrien B. Taylor, Francis R. Bach Stochastic first-order methods: non-asymptotic and computer-aided analyses via potential functions. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Yeshwanth Cherapanamjeri, Peter L. Bartlett Testing Symmetric Markov Chains Without Hitting. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Nicholas J. A. Harvey, Christopher Liaw, Yaniv Plan, Sikander Randhawa Tight analyses for non-smooth stochastic gradient descent. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Matthew S. Brennan, Guy Bresler Optimal Average-Case Reductions to Sparse PCA: From Weak Assumptions to Strong Hardness. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Alexander Rakhlin, Xiyu Zhai Consistency of Interpolation with Laplace Kernels is a High-Dimensional Phenomenon. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Surbhi Goel, Adam R. Klivans Learning Neural Networks with Two Nonlinear Layers in Polynomial Time. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Jelena Diakonikolas, Cristóbal Guzmán Lower Bounds for Parallel and Randomized Convex Optimization. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Wen Sun 0002, Nan Jiang 0008, Akshay Krishnamurthy, Alekh Agarwal, John Langford 0001 Model-based RL in Contextual Decision Processes: PAC bounds and Exponential Improvements over Model-free Approaches. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Filipo Studzinski Perotto, Mathieu Bourgais, Bruno C. Silva, Laurent Vercouter Open Problem: Risk of Ruin in Multiarmed Bandits. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Dmitrii M. Ostrovskii, Alessandro Rudi Affine Invariant Covariance Estimation for Heavy-Tailed Distributions. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Christopher Tosh, Sanjoy Dasgupta The Relative Complexity of Maximum Likelihood Estimation, MAP Estimation, and Sampling. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Daniel Kane 0001, Roi Livni, Shay Moran, Amir Yehudayoff On Communication Complexity of Classification Problems. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Omar Montasser, Steve Hanneke, Nathan Srebro VC Classes are Adversarially Robustly Learnable, but Only Improperly. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1 Preface. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Ashok Cutkosky Combining Online Learning Guarantees. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Itay Safran, Ronen Eldan, Ohad Shamir Depth Separations in Neural Networks: What is Actually Being Separated? Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Nadav Merlis, Shie Mannor Batch-Size Independent Regret Bounds for the Combinatorial Multi-Armed Bandit Problem. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Oren Mangoubi, Nisheeth K. Vishnoi Nonconvex sampling with the Metropolis-adjusted Langevin algorithm. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Naman Agarwal, Alon Gonen, Elad Hazan Learning in Non-convex Games with an Optimization Oracle. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Santosh S. Vempala, John Wilmes Gradient Descent for One-Hidden-Layer Neural Networks: Polynomial Convergence and SQ Lower Bounds. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Song Mei, Theodor Misiakiewicz, Andrea Montanari Mean-field theory of two-layers neural networks: dimension-free bounds and kernel limit. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Jan Hazla, Ali Jadbabaie, Elchanan Mossel, M. Amin Rahimian Reasoning in Bayesian Opinion Exchange Networks Is PSPACE-Hard. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Kwang-Sung Jun, Francesco Orabona Parameter-Free Online Convex Optimization with Sub-Exponential Noise. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Dan Garber On the Regret Minimization of Nonconvex Online Gradient Ascent for Online PCA. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Belhal Karimi, Blazej Miasojedow, Eric Moulines, Hoi-To Wai Non-asymptotic Analysis of Biased Stochastic Approximation Scheme. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Pedro Savarese, Itay Evron, Daniel Soudry, Nathan Srebro How do infinite width bounded norm networks look in function space? Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Ilja Kuzborskij, Nicolò Cesa-Bianchi, Csaba Szepesvári Distribution-Dependent Analysis of Gibbs-ERM Principle. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Ilias Diakonikolas, Daniel M. Kane, John Peebles Testing Identity of Multidimensional Histograms. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Mingda Qiao, Gregory Valiant A Theory of Selective Prediction. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Henry W. J. Reeve, Ata Kabán Classification with unknown class-conditional label noise on non-compact feature spaces. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Sébastien Bubeck, Qijia Jiang, Yin Tat Lee, Yuanzhi Li, Aaron Sidford Near-optimal method for highly smooth convex optimization. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Prateek Jain 0002, Dheeraj Nagaraj, Praneeth Netrapalli Making the Last Iterate of SGD Information Theoretically Optimal. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Tongyi Cao, Akshay Krishnamurthy Disagreement-Based Combinatorial Pure Exploration: Sample Complexity Bounds and an Efficient Algorithm. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Samuel B. Hopkins, Jerry Li 0001 How Hard is Robust Mean Estimation? Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Tom J. Viering, Alexander Mey, Marco Loog Open Problem: Monotonicity of Learning. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Akshay Krishnamurthy, John Langford 0001, Aleksandrs Slivkins, Chicheng Zhang Contextual bandits with continuous actions: Smoothing, zooming, and adapting. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Yingkai Li, Yining Wang, Yuan Zhou 0007 Nearly Minimax-Optimal Regret for Linearly Parameterized Bandits. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Surbhi Goel, Daniel M. Kane, Adam R. Klivans Learning Ising Models with Independent Failures. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Shi Dong 0003, Tengyu Ma 0001, Benjamin Van Roy On the Performance of Thompson Sampling on Logistic Bandits. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Jeongyeol Kwon, Wei Qian, Constantine Caramanis, Yudong Chen 0001, Damek Davis Global Convergence of the EM Algorithm for Mixtures of Two Component Linear Regression. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Wojciech Kotlowski, Gergely Neu Bandit Principal Component Analysis. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Yuval Dagan, Gil Kur, Ohad Shamir Space lower bounds for linear prediction in the streaming model. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Yin Tat Lee, Zhao Song 0002, Qiuyi Zhang 0001 Solving Empirical Risk Minimization in the Current Matrix Multiplication Time. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Ilias Diakonikolas, Themis Gouleakis, Daniel M. Kane, Sankeerth Rao Communication and Memory Efficient Testing of Discrete Distributions. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Gautam Kamath 0001, Jerry Li 0001, Vikrant Singhal, Jonathan R. Ullman Privately Learning High-Dimensional Distributions. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Max Simchowitz, Ross Boczar, Benjamin Recht Learning Linear Dynamical Systems with Semi-Parametric Least Squares. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Stephen Tu, Benjamin Recht The Gap Between Model-Based and Model-Free Methods on the Linear Quadratic Regulator: An Asymptotic Viewpoint. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Sandeep Juneja 0001, Subhashini Krishnasamy Sample complexity of partition identification using multi-armed bandits. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Jayadev Acharya, Clément L. Canonne, Himanshu Tyagi Inference under Information Constraints: Lower Bounds from Chi-Square Contraction. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Amit Daniely, Vitaly Feldman Open Problem: Is Margin Sufficient for Non-Interactive Private Distributed Learning? Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Jonathan Weed, Quentin Berthet Estimation of smooth densities in Wasserstein distance. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Navin Goyal, Abhishek Shetty Sampling and Optimization on Convex Sets in Riemannian Manifolds of Non-Negative Curvature. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Galen Reeves, Jiaming Xu, Ilias Zadik The All-or-Nothing Phenomenon in Sparse Linear Regression. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Jerry Li 0001, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten On Mean Estimation for General Norms with Statistical Queries. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Maryam Aliakbarpour, Themis Gouleakis, John Peebles, Ronitt Rubinfeld, Anak Yodpinyanee Towards Testing Monotonicity of Distributions Over General Posets. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Alexander V. Gasnikov, Pavel E. Dvurechensky, Eduard Gorbunov, Evgeniya A. Vorontsova, Daniil Selikhanovych, César A. Uribe Optimal Tensor Methods in Smooth Convex and Uniformly ConvexOptimization. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Peter Auer, Yifang Chen, Pratik Gajane, Chung-Wei Lee, Haipeng Luo, Ronald Ortner, Chen-Yu Wei Achieving Optimal Dynamic Regret for Non-stationary Bandits without Prior Information. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Aditya Bhaskara, Wai Ming Tai Approximate Guarantees for Dictionary Learning. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Olivier Bousquet, Daniel Kane 0001, Shay Moran The Optimal Approximation Factor in Density Estimation. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Yifang Chen, Chung-Wei Lee, Haipeng Luo, Chen-Yu Wei A New Algorithm for Non-stationary Contextual Bandits: Efficient, Optimal and Parameter-free. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Ludovic Stephan, Laurent Massoulié Robustness of Spectral Methods for Community Detection. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Bo Jiang 0007, Haoyue Wang, Shuzhong Zhang An Optimal High-Order Tensor Method for Convex Optimization. Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
Displaying result #601 - #700 of 2196 (100 per page; Change: )
Pages: [<<][1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license