skip to main content
Skip header Section
Understanding Machine Learning: From Theory to AlgorithmsJune 2014
Publisher:
  • Cambridge University Press
  • 40 W. 20 St. New York, NY
  • United States
ISBN:978-1-107-05713-5
Published:30 June 2014
Pages:
424
Skip Bibliometrics Section
Bibliometrics
Skip Abstract Section
Abstract

Machine learning is one of the fastest growing areas of computer science, with far-reaching applications. The aim of this textbook is to introduce machine learning, and the algorithmic paradigms it offers, in a principled way. The book provides an extensive theoretical account of the fundamental ideas underlying machine learning and the mathematical derivations that transform these principles into practical algorithms. Following a presentation of the basics of the field, the book covers a wide array of central topics that have not been addressed by previous textbooks. These include a discussion of the computational complexity of learning and the concepts of convexity and stability; important algorithmic paradigms including stochastic gradient descent, neural networks, and structured output learning; and emerging theoretical concepts such as the PAC-Bayes approach and compression-based bounds. Designed for an advanced undergraduate or beginning graduate course, the text makes the fundamentals and algorithms of machine learning accessible to students and non-expert readers in statistics, computer science, mathematics, and engineering.

Cited By

  1. Su J, Xu J and Wang D (2024). PAC learning halfspaces in non-interactive local differential privacy model with public unlabeled data, Journal of Computer and System Sciences, 141:C, Online publication date: 1-May-2024.
  2. Chen L and Jiang H (2024). On the information complexity for integration in subspaces of the Wiener algebra, Journal of Complexity, 81:C, Online publication date: 1-Apr-2024.
  3. ACM
    Wang H, Wu Z and He J FairIF: Boosting Fairness in Deep Learning via Influence Functions with Validation Set Sensitive Attributes Proceedings of the 17th ACM International Conference on Web Search and Data Mining, (721-730)
  4. Petersen P and Sepliarskaia A (2024). VC dimensions of group convolutional neural networks, Neural Networks, 169:C, (462-474), Online publication date: 1-Jan-2024.
  5. Franco D, D’Amato V, Pasa L, Navarin N and Oneto L (2024). Fair graph representation learning, Neurocomputing, 563:C, Online publication date: 1-Jan-2024.
  6. Jawad A, Maaloul R and Chaari L (2023). A comprehensive survey on 6G and beyond, Computer Networks: The International Journal of Computer and Telecommunications Networking, 237:C, Online publication date: 1-Dec-2023.
  7. ACM
    Sun J, Yang J, Mo K, Lai Y, Guibas L and Gao L (2023). Haisor: Human-Aware Indoor Scene Optimization via Deep Reinforcement Learning, ACM Transactions on Graphics, 0:0
  8. ACM
    He H, Wu X and Wang Q Forecasting Urban Mobility using Sparse Data: A Gradient Boosted Fusion Tree Approach Proceedings of the 1st International Workshop on the Human Mobility Prediction Challenge, (41-46)
  9. Pham H, Dai Z, Ghiasi G, Kawaguchi K, Liu H, Yu A, Yu J, Chen Y, Luong M, Wu Y, Tan M and Le Q (2023). Combined scaling for zero-shot transfer learning, Neurocomputing, 555:C, Online publication date: 28-Oct-2023.
  10. Tian P and Yu H (2023). Can we improve meta-learning model in few-shot learning by aligning data distributions?, Knowledge-Based Systems, 277:C, Online publication date: 9-Oct-2023.
  11. Gavaskar R, Athalye C and Chaudhury K (2023). On exact and robust recovery for plug-and-Play compressed sensing, Signal Processing, 211:C, Online publication date: 1-Oct-2023.
  12. Campagner A, Famiglini L, Carobene A and Cabitza F (2023). Everything is varied, Applied Soft Computing, 146:C, Online publication date: 1-Oct-2023.
  13. Bhattacharjee A, Cecconello S, Kuipers F and Smaragdakis G Fingerprinting of Cellular Infrastructure Based on Broadcast Information Computer Security – ESORICS 2023, (81-101)
  14. ACM
    Yang H, Liu Z, Zhang Z, Zhuang C and Chen X Towards Robust Fairness-aware Recommendation Proceedings of the 17th ACM Conference on Recommender Systems, (211-222)
  15. Popescu M, Grama L and Rusu C (2023). An algorithm for training a class of polynomial models, Digital Signal Processing, 141:C, Online publication date: 1-Sep-2023.
  16. ACM
    Monath N, Zaheer M and McCallum A Online Level-wise Hierarchical Clustering Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, (1733-1745)
  17. Liang Y, Liu J and Xu D (2023). Stochastic momentum methods for non-convex learning without bounded assumptions, Neural Networks, 165:C, (830-845), Online publication date: 1-Aug-2023.
  18. Zhou Y, Lu M, Liu X, Che Z, Xu Z, Tang J, Zhang Y, Peng Y and Peng Y (2023). Distributional generative adversarial imitation learning with reproducing kernel generalization, Neural Networks, 165:C, (43-59), Online publication date: 1-Aug-2023.
  19. Zhang Z and Zhou S (2023). Adaptive proximal SGD based on new estimating sequences for sparser ERM, Information Sciences: an International Journal, 638:C, Online publication date: 1-Aug-2023.
  20. Wang X, Ping W and Al-Shati A (2023). Numerical simulation of ozonation in hollow-fiber membranes for wastewater treatment, Engineering Applications of Artificial Intelligence, 123:PB, Online publication date: 1-Aug-2023.
  21. Bienstock D, Muñoz G and Pokutta S (2023). Principled deep neural network training through linear programming, Discrete Optimization, 49:C, Online publication date: 1-Aug-2023.
  22. Oneto L, Ridella S and Anguita D (2023). Do we really need a new theory to understand over-parameterization?, Neurocomputing, 543:C, Online publication date: 28-Jul-2023.
  23. ACM
    Gupta S, Oosterhuis H and de Rijke M Safe Deployment for Counterfactual Learning to Rank with Exposure-Based Risk Minimization Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval, (249-258)
  24. Fu C, Zhou S, Chen Y, Chen L and Han B (2023). A risk-averse learning machine via variance-dependent penalization, Pattern Recognition Letters, 171:C, (116-123), Online publication date: 1-Jul-2023.
  25. Levy W and Baxter R (2023). Growing dendrites enhance a neuron’s computational power and memory capacity, Neural Networks, 164:C, (275-309), Online publication date: 1-Jul-2023.
  26. Bai L, Qi M and Liang J (2023). Spectral clustering with robust self-learning constraints, Artificial Intelligence, 320:C, Online publication date: 1-Jul-2023.
  27. ACM
    Gaitonde J and Tardos É (2023). The Price of Anarchy of Strategic Queuing Systems, Journal of the ACM, 70:3, (1-63), Online publication date: 30-Jun-2023.
  28. ACM
    Liang Z and Dvorkin Y Data-Driven Inverse Optimization for Marginal Offer Price Recovery in Electricity Markets Proceedings of the 14th ACM International Conference on Future Energy Systems, (497-509)
  29. ACM
    Geerts F A Query Language Perspective on Graph Learning Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, (373-379)
  30. ACM
    Hatami H, Hosseini K and Meng X A Borsuk-Ulam Lower Bound for Sign-Rank and Its Applications Proceedings of the 55th Annual ACM Symposium on Theory of Computing, (463-471)
  31. ACM
    Gollakota A, Klivans A and Kothari P A Moment-Matching Approach to Testable Learning and a New Characterization of Rademacher Complexity Proceedings of the 55th Annual ACM Symposium on Theory of Computing, (1657-1670)
  32. ACM
    Vardi G (2023). On the Implicit Bias in Deep-Learning Algorithms, Communications of the ACM, 66:6, (86-93), Online publication date: 1-Jun-2023.
  33. Wang J, Hu J, Mills J, Min G, Xia M and Georgalas N (2023). Federated Ensemble Model-Based Reinforcement Learning in Edge Computing, IEEE Transactions on Parallel and Distributed Systems, 34:6, (1848-1859), Online publication date: 1-Jun-2023.
  34. Viering T and Loog M (2023). The Shape of Learning Curves: A Review, IEEE Transactions on Pattern Analysis and Machine Intelligence, 45:6, (7799-7819), Online publication date: 1-Jun-2023.
  35. Tsvieli A and Weinberger N (2023). Learning Maximum Margin Channel Decoders, IEEE Transactions on Information Theory, 69:6, (3597-3626), Online publication date: 1-Jun-2023.
  36. Liu H, Rush C and Baron D (2023). Rigorous State Evolution Analysis for Approximate Message Passing With Side Information, IEEE Transactions on Information Theory, 69:6, (3989-4013), Online publication date: 1-Jun-2023.
  37. Fowdur T and Doorgakant B (2023). A review of machine learning techniques for enhanced energy efficient 5G and 6G communications, Engineering Applications of Artificial Intelligence, 122:C, Online publication date: 1-Jun-2023.
  38. Duan Z, Huang W, Zhang D, Du Y, Wang J, Yang Y and Deng X Is Nash Equilibrium Approximator Learnable? Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, (233-241)
  39. ACM
    Zeighami S, Shahabi C and Sharan V (2023). NeuroSketch: Fast and Approximate Evaluation of Range Aggregate Queries with Neural Networks, Proceedings of the ACM on Management of Data, 1:1, (1-26), Online publication date: 26-May-2023.
  40. Pan Y, Tang K and Sun G (2023). Theoretical guarantee for crowdsourcing learning with unsure option, Pattern Recognition, 137:C, Online publication date: 1-May-2023.
  41. ACM
    Jha T and Zick Y (2023). A Learning Framework for Distribution-Based Game-Theoretic Solution Concepts, ACM Transactions on Economics and Computation, 11:1-2, (1-23), Online publication date: 31-Mar-2023.
  42. Ponzio F, Macii E, Ficarra E and Di Cataldo S (2023). W2WNet, Expert Systems with Applications: An International Journal, 214:C, Online publication date: 15-Mar-2023.
  43. Ronca A, Knorozova N and De Giacomo G Automata cascades Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence and Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence and Thirteenth Symposium on Educational Advances in Artificial Intelligence, (9588-9595)
  44. Mandal D, Radanović G, Gan J, Singla A and Majumdar R Online reinforcement learning with uncertain episode lengths Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence and Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence and Thirteenth Symposium on Educational Advances in Artificial Intelligence, (9064-9071)
  45. Levy O and Mansour Y Optimism in face of a context Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence and Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence and Thirteenth Symposium on Educational Advances in Artificial Intelligence, (8510-8517)
  46. Chen X, Duan J, Liang Y and Zhao L Global convergence of two-timescale actor-critic for solving linear quadratic regulator Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence and Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence and Thirteenth Symposium on Educational Advances in Artificial Intelligence, (7087-7095)
  47. Bressan M, Damay G and Sozio M Fully-dynamic decision trees Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence and Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence and Thirteenth Symposium on Educational Advances in Artificial Intelligence, (6842-6849)
  48. Fu Z, Yang H, So A, Lam W, Bing L and Collier N On the effectiveness of parameter-efficient fine-tuning Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence and Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence and Thirteenth Symposium on Educational Advances in Artificial Intelligence, (12799-12807)
  49. Kalikatzarakis M, Coraddu A, Atlar M, Gaggero S, Tani G and Oneto L (2023). Physically plausible propeller noise prediction via recursive corrections leveraging prior knowledge and experimental data, Engineering Applications of Artificial Intelligence, 118:C, Online publication date: 1-Feb-2023.
  50. ACM
    Li D, Li Q, Ye Y and Xu S (2021). Arms Race in Adversarial Malware Detection: A Survey, ACM Computing Surveys, 55:1, (1-35), Online publication date: 31-Jan-2023.
  51. Iosevich A, McDonald B and Sun M (2023). Dot products in F q 3 and the Vapnik-Chervonenkis dimension, Discrete Mathematics, 346:1, Online publication date: 1-Jan-2023.
  52. Wang Z, Jungers R and Ong C (2023). Computation of invariant sets via immersion for discrete-time nonlinear systems, Automatica (Journal of IFAC), 147:C, Online publication date: 1-Jan-2023.
  53. Kumar M, Kolb S, Teso S and De Raedt L (2023). Learning MAX-SAT from contextual examples for combinatorial optimisation, Artificial Intelligence, 314:C, Online publication date: 1-Jan-2023.
  54. Panthi M and Kanti Das T (2022). Intelligent Intrusion Detection Scheme for Smart Power-Grid Using Optimized Ensemble Learning on Selected Features, International Journal of Critical Infrastructure Protection, 39:C, Online publication date: 1-Dec-2022.
  55. Laperrière-Robillard T, Morin M and Abi-Zeid I (2022). Supervised learning for maritime search operations, Expert Systems with Applications: An International Journal, 206:C, Online publication date: 15-Nov-2022.
  56. Wang J, Shao H, Yao Y, Liu J, Sun H and Ma S (2022). Electroencephalograph-based emotion recognition using convolutional neural network without manual feature extraction, Applied Soft Computing, 128:C, Online publication date: 1-Oct-2022.
  57. Marcianò A, Chen D, Fabrocini F, Fields C, Greco E, Gresnigt N, Jinklub K, Lulli M, Terzidis K and Zappala E (2022). Quantum Neural Networks and Topological Quantum Field Theories, Neural Networks, 153:C, (164-178), Online publication date: 1-Sep-2022.
  58. ACM
    Alon N, Bun M, Livni R, Malliaris M and Moran S (2022). Private and Online Learnability Are Equivalent, Journal of the ACM, 69:4, (1-34), Online publication date: 31-Aug-2022.
  59. ACM
    Ding S, Wu P, Feng F, Wang Y, He X, Liao Y and Zhang Y Addressing Unmeasured Confounder for Recommendation with Sensitivity Analysis Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, (305-315)
  60. Kurri G, Welfert M, Sypherd T and Sankar L α-GAN: Convergence and Estimation Guarantees 2022 IEEE International Symposium on Information Theory (ISIT), (276-281)
  61. ACM
    Kuhl U, Artelt A and Hammer B Keep Your Friends Close and Your Counterfactuals Closer: Improved Learning From Closest Rather Than Plausible Counterfactual Explanations in an Abstract Setting Proceedings of the 2022 ACM Conference on Fairness, Accountability, and Transparency, (2125-2137)
  62. ACM
    Cousins C Uncertainty and the Social Planner’s Problem: Why Sample Complexity Matters Proceedings of the 2022 ACM Conference on Fairness, Accountability, and Transparency, (2004-2015)
  63. ACM
    Black E, Raghavan M and Barocas S Model Multiplicity: Opportunities, Concerns, and Solutions Proceedings of the 2022 ACM Conference on Fairness, Accountability, and Transparency, (850-863)
  64. ACM
    Hong J, Wang Z and Zhou J Dynamic Privacy Budget Allocation Improves Data Efficiency of Differentially Private Gradient Descent Proceedings of the 2022 ACM Conference on Fairness, Accountability, and Transparency, (11-35)
  65. ACM
    van Bergerem S, Grohe M and Ritzert M On the Parameterized Complexity of Learning First-Order Logic Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, (337-346)
  66. ACM
    Almagor S, Chistikov D, Ouaknine J and Worrell J (2022). O-Minimal Invariants for Discrete-Time Dynamical Systems, ACM Transactions on Computational Logic, 23:2, (1-20), Online publication date: 30-Apr-2022.
  67. ACM
    Kassaie B, Irving E and Tompa F (2021). Computer-Assisted Cohort Identification in Practice, ACM Transactions on Computing for Healthcare, 3:2, (1-28), Online publication date: 30-Apr-2022.
  68. Clausen J and Li H (2021). Big data driven order-up-to level model, Computers and Operations Research, 139:C, Online publication date: 1-Mar-2022.
  69. ACM
    Rebelo A, Inês G and Damion D (2022). The Impact of Artificial Intelligence on the Creativity of Videos, ACM Transactions on Multimedia Computing, Communications, and Applications, 18:1, (1-27), Online publication date: 31-Jan-2022.
  70. Martín-Guerrero J and Lamata L (2022). Quantum Machine Learning, Neurocomputing, 470:C, (457-461), Online publication date: 22-Jan-2022.
  71. Nguyen N, Nguyen Q, Pham H, Le T, Nguyen T, Cassi D, Scotognella F, Alfieri R, Bellingeri M and Murari A (2022). Predicting the Robustness of Large Real-World Social Networks Using a Machine Learning Model, Complexity, 2022, Online publication date: 1-Jan-2022.
  72. Loreggia A, Passarelli A and Pini M (2022). The Influence of Environmental Factors on the Spread of COVID-19 in Italy, Procedia Computer Science, 207:C, (573-582), Online publication date: 1-Jan-2022.
  73. ACM
    Shan S, Bhagoji A, Zheng H and Zhao B Patch-based Defenses against Web Fingerprinting Attacks Proceedings of the 14th ACM Workshop on Artificial Intelligence and Security, (97-109)
  74. ACM
    Zou Z, Kim Y, Imani F, Alimohamadi H, Cammarota R and Imani M Scalable edge-based hyperdimensional learning system with brain-like neural adaptation Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, (1-15)
  75. Chicco D and Oneto L (2020). An Enhanced Random Forests Approach to Predict Heart Failure From Small Imbalanced Gene Expression Data, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 18:6, (2759-2765), Online publication date: 1-Nov-2021.
  76. De Ryck T, Lanthaler S and Mishra S (2021). On the approximation of functions by tanh neural networks, Neural Networks, 143:C, (732-750), Online publication date: 1-Nov-2021.
  77. ACM
    Masadeh M, Elderhalli Y, Hasan O and Tahar S (2021). A Quality-assured Approximate Hardware Accelerators–based on Machine Learning and Dynamic Partial Reconfiguration, ACM Journal on Emerging Technologies in Computing Systems, 17:4, (1-19), Online publication date: 31-Oct-2021.
  78. ACM
    Yang M, Dai Q, Dong Z, Chen X, He X and Wang J Top-N Recommendation with Counterfactual User Preference Simulation Proceedings of the 30th ACM International Conference on Information & Knowledge Management, (2342-2351)
  79. ACM
    Xiong K, Ye W, Chen X, Zhang Y, Zhao W, Hu B, Zhang Z and Zhou J Counterfactual Review-based Recommendation Proceedings of the 30th ACM International Conference on Information & Knowledge Management, (2231-2240)
  80. ACM
    Sarkar S, Buddhikot M, Baset A and Kasera S DeepRadar Proceedings of the 27th Annual International Conference on Mobile Computing and Networking, (56-68)
  81. ACM
    Dhar S, Guo J, Liu J, Tripathi S, Kurup U and Shah M (2021). A Survey of On-Device Machine Learning, ACM Transactions on Internet of Things, 2:3, (1-49), Online publication date: 31-Aug-2021.
  82. ACM
    Villalobos-Arias L and Quesada-López C Comparative study of random search hyper-parameter tuning for software effort estimation Proceedings of the 17th International Conference on Predictive Models and Data Analytics in Software Engineering, (21-29)
  83. ACM
    Bhatt U, Antorán J, Zhang Y, Liao Q, Sattigeri P, Fogliato R, Melançon G, Krishnan R, Stanley J, Tickoo O, Nachman L, Chunara R, Srikumar M, Weller A and Xiang A Uncertainty as a Form of Transparency: Measuring, Communicating, and Using Uncertainty Proceedings of the 2021 AAAI/ACM Conference on AI, Ethics, and Society, (401-413)
  84. ACM
    Jafarinejad F, Narasimhan K and Mezini M NerdBug: automated bug detection in neural networks Proceedings of the 1st ACM International Workshop on AI and Software Testing/Analysis, (13-16)
  85. ACM
    Chen J, Dong H, Qiu Y, He X, Xin X, Chen L, Lin G and Yang K AutoDebias: Learning to Debias for Recommendation Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval, (21-30)
  86. ACM
    Wang Z, Zhang J, Xu H, Chen X, Zhang Y, Zhao W and Wen J Counterfactual Data-Augmented Sequential Recommendation Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval, (347-356)
  87. ACM
    Chen C, Watabe M, Shiba K, Sogabe M, Sakamoto K and Sogabe T (2021). On the Expressibility and Overfitting of Quantum Circuit Learning, ACM Transactions on Quantum Computing, 2:2, (1-24), Online publication date: 1-Jul-2021.
  88. ACM
    Lai S, Billot A, Varkanitsa M, Braun E, Rapp B, Parrish T, Kurani A, Higgins J, Caplan D, Thompson C, Kiran S, Betke M and Ishwar P An Exploration of Machine Learning Methods for Predicting Post-stroke Aphasia Recovery Proceedings of the 14th PErvasive Technologies Related to Assistive Environments Conference, (556-564)
  89. ACM
    Daskalakis C, Skoulakis S and Zampetakis M The complexity of constrained min-max optimization Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, (1466-1478)
  90. ACM
    Blais E, Ferreira Pinto Jr. R and Harms N VC dimension and distribution-free sample-based testing Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, (504-517)
  91. ACM
    Dwork C, Kim M, Reingold O, Rothblum G and Yona G Outcome indistinguishability Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, (1095-1108)
  92. Zhang Y, McQuillan F, Jayaram N, Kak N, Khanna E, Kislal O, Valdano D and Kumar A (2021). Distributed deep learning on data systems, Proceedings of the VLDB Endowment, 14:10, (1769-1782), Online publication date: 1-Jun-2021.
  93. Lackner M and Maly J Approval-Based Shortlisting Proceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems, (737-745)
  94. ACM
    Almeida M, Zhuang Y, Ding W, Crouter S and Chen P (2021). Mitigating Class-Boundary Label Uncertainty to Reduce Both Model Bias and Variance, ACM Transactions on Knowledge Discovery from Data, 15:2, (1-18), Online publication date: 30-Apr-2021.
  95. ACM
    Wu W, Zhao Y, Zhu E, Liu X, Zhang X, Luo L, Wang S and Yin J (2020). A Theoretical Revisit to Linear Convergence for Saddle Point Problems, ACM Transactions on Intelligent Systems and Technology, 12:1, (1-17), Online publication date: 1-Feb-2021.
  96. ACM
    Tassarotti J, Vajjha K, Banerjee A and Tristan J A formal proof of PAC learnability for decision stumps Proceedings of the 10th ACM SIGPLAN International Conference on Certified Programs and Proofs, (5-17)
  97. Varma N and Yoshida Y Average sensitivity of graph algorithms Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, (684-703)
  98. Bohani F, Suliman A, Saripuddin M, Sameon S, Md Salleh N, Nazeri S and Mandeep J (2021). A Comprehensive Analysis of Supervised Learning Techniques for Electricity Theft Detection, Journal of Electrical and Computer Engineering, 2021, Online publication date: 1-Jan-2021.
  99. Oluwasammi A, Aftab M, Qin Z, Ngo S, Doan T, Nguyen S, Nguyen S, Nguyen G and Selisteanu D (2021). Features to Text, Complexity, 2021, Online publication date: 1-Jan-2021.
  100. Zhao Y, Zhu E, Liu X, Tang C, Guo D and Yin J (2020). Simultaneous Clustering and Optimization for Evolving Datasets, IEEE Transactions on Knowledge and Data Engineering, 33:1, (259-270), Online publication date: 1-Jan-2021.
  101. Raviv N, Tamo I, Tandon R and Dimakis A (2020). Gradient Coding From Cyclic MDS Codes and Expander Graphs, IEEE Transactions on Information Theory, 66:12, (7475-7489), Online publication date: 1-Dec-2020.
  102. Moran S and Yehudayoff A (2020). On Weak -Nets and the Radon Number, Discrete & Computational Geometry, 64:4, (1125-1140), Online publication date: 1-Dec-2020.
  103. Rosasco L, Villa S and Vũ B (2020). Convergence of Stochastic Proximal Gradient Algorithm, Applied Mathematics and Optimization, 82:3, (891-917), Online publication date: 1-Dec-2020.
  104. ACM
    Villalobos-Arias L, Quesada-López C, Guevara-Coto J, Martínez A and Jenkins M Evaluating hyper-parameter tuning using random search in support vector machines for software effort estimation Proceedings of the 16th ACM International Conference on Predictive Models and Data Analytics in Software Engineering, (31-40)
  105. Xu P, Roosta F and Mahoney M (2020). Newton-type methods for non-convex optimization under inexact Hessian information, Mathematical Programming: Series A and B, 184:1-2, (35-70), Online publication date: 1-Nov-2020.
  106. ACM
    Rozemberczki B, Kiss O and Sarkar R Little Ball of Fur Proceedings of the 29th ACM International Conference on Information & Knowledge Management, (3133-3140)
  107. Coronado E, Thomas A and Riggio R (2020). Adaptive ML-Based Frame Length Optimisation in Enterprise SD-WLANs, Journal of Network and Systems Management, 28:4, (850-881), Online publication date: 1-Oct-2020.
  108. Campagner A and Ciucci D A Formal Learning Theory for Three-Way Clustering Scalable Uncertainty Management, (128-140)
  109. Masure L, Belleville N, Cagli E, Cornélie M, Couroussé D, Dumas C and Maingault L Deep Learning Side-Channel Analysis on Large-Scale Traces Computer Security – ESORICS 2020, (440-460)
  110. Campagner A, Ciucci D and Cabitza F Ensemble Learning, Social Choice and Collective Intelligence Modeling Decisions for Artificial Intelligence, (53-65)
  111. Beaulac C and Rosenthal J (2020). BEST: a decision tree algorithm that handles missing values, Computational Statistics, 35:3, (1001-1026), Online publication date: 1-Sep-2020.
  112. ACM
    Du X, Hargreaves C, Sheppard J, Anda F, Sayakkara A, Le-Khac N and Scanlon M SoK Proceedings of the 15th International Conference on Availability, Reliability and Security, (1-10)
  113. ACM
    Pellegrina L, Cousins C, Vandin F and Riondato M MCRapper: Monte-Carlo Rademacher Averages for Poset Families and Approximate Pattern Mining Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, (2165-2174)
  114. ACM
    Riondato M and Vandin F (2020). MiSoSouP, ACM Transactions on Knowledge Discovery from Data, 14:5, (1-31), Online publication date: 21-Aug-2020.
  115. ACM
    Huai M, Miao C, Li Y, Suo Q, Su L and Zhang A (2020). Learning Distance Metrics from Probabilistic Information, ACM Transactions on Knowledge Discovery from Data, 14:5, (1-33), Online publication date: 21-Aug-2020.
  116. Nakandala S, Zhang Y and Kumar A (2020). Cerebro, Proceedings of the VLDB Endowment, 13:12, (2159-2173), Online publication date: 1-Aug-2020.
  117. Liang T, He L, Lu C, Chen L, Ying H, Yu P and Wu J (2020). CAMAR: a broad learning based context-aware recommender for mobile applications, Knowledge and Information Systems, 62:8, (3291-3319), Online publication date: 1-Aug-2020.
  118. Nasiri J and Mir A (2020). An enhanced KNN-based twin support vector machine with stable learning rules, Neural Computing and Applications, 32:16, (12949-12969), Online publication date: 1-Aug-2020.
  119. ACM
    Ben-Nun T and Hoefler T (2019). Demystifying Parallel and Distributed Deep Learning, ACM Computing Surveys, 52:4, (1-43), Online publication date: 31-Jul-2020.
  120. ACM
    Jagerman R and de Rijke M Accelerated Convergence for Counterfactual Learning to Rank Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval, (469-478)
  121. ACM
    Gaitonde J and Tardos É Stability and Learning in Strategic Queuing Systems Proceedings of the 21st ACM Conference on Economics and Computation, (319-347)
  122. ACM
    Fathi R, Molla A and Pandurangan G Efficient Distributed Algorithms for the K-Nearest Neighbors Problem Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, (527-529)
  123. Santucci V, Forti L, Santarelli F, Spina S and Milani A Learning to Classify Text Complexity for the Italian Language Using Support Vector Machines Computational Science and Its Applications – ICCSA 2020, (367-376)
  124. Moran S, Nachum I, Panasoff I and Yehudayoff A On the Perceptron’s Compression Beyond the Horizon of Computability, (310-325)
  125. Ozaki A On the Complexity of Learning Description Logic Ontologies Reasoning Web. Declarative Artificial Intelligence, (36-52)
  126. Wu X, Manton J, Aickelin U and Zhu J Information-theoretic analysis for transfer learning 2020 IEEE International Symposium on Information Theory (ISIT), (2819-2824)
  127. ACM
    Lim M, Akcay M, Bentaleb A, Begen A and Zimmermann R When they go high, we go low Proceedings of the 11th ACM Multimedia Systems Conference, (321-326)
  128. Caro M (2020). Quantum learning Boolean linear functions w.r.t. product distributions, Quantum Information Processing, 19:6, Online publication date: 11-May-2020.
  129. Viering T, Mey A and Loog M Making Learners (More) Monotone Advances in Intelligent Data Analysis XVIII, (535-547)
  130. Mey A, Viering T and Loog M A Distribution Dependent and Independent Complexity Analysis of Manifold Regularization Advances in Intelligent Data Analysis XVIII, (326-338)
  131. Cornuéjols A, Murena P and Olivier R Transfer Learning by Learning Projections from Target to Source Advances in Intelligent Data Analysis XVIII, (119-131)
  132. Servan-Schreiber S, Riondato M and Zgraggen E (2019). ProSecCo: progressive sequence mining with convergence guarantees, Knowledge and Information Systems, 62:4, (1313-1340), Online publication date: 1-Apr-2020.
  133. Setiawan N, Rubinstein B and Borovica-Gajic R Function Interpolation for Learned Index Structures Databases Theory and Applications, (68-80)
  134. Wandelt S, Shi X, Sun X and Bueno Á (2020). Approximation of Interactive Betweenness Centrality in Large Complex Networks, Complexity, 2020, Online publication date: 1-Jan-2020.
  135. Qi J, Du J, Siniscalchi S, Ma X and Lee C (2020). Analyzing Upper Bounds on Mean Absolute Errors for Deep Neural Network-Based Vector-to-Vector Regression, IEEE Transactions on Signal Processing, 68, (3411-3422), Online publication date: 1-Jan-2020.
  136. Song L, Xu Y, Zhang L, Du B, Zhang Q and Wang X (2020). Learning From Synthetic Images via Active Pseudo-Labeling, IEEE Transactions on Image Processing, 29, (6452-6465), Online publication date: 1-Jan-2020.
  137. Spini G, van Heesch M, Veugen T and Chatterjea S (2019). Private Hospital Workflow Optimization via Secure k-Means Clustering, Journal of Medical Systems, 44:1, Online publication date: 10-Dec-2019.
  138. Jun K, Cutkosky A and Orabona F Kernel truncated randomized ridge regression Proceedings of the 33rd International Conference on Neural Information Processing Systems, (15358-15367)
  139. Li X and Li P Generalization error analysis of quantized compressive learning Proceedings of the 33rd International Conference on Neural Information Processing Systems, (15150-15160)
  140. Frei S, Cao Y and Gu Q Algorithm-dependent generalization bounds for overparameterized deep residual networks Proceedings of the 33rd International Conference on Neural Information Processing Systems, (14797-14807)
  141. El Balghiti O, Elmachtoub A, Grigas P and Tewari A Generalization bounds in the predict-then-optimize framework Proceedings of the 33rd International Conference on Neural Information Processing Systems, (14412-14421)
  142. Denevi G, Stamos D, Ciliberto C and Pontil M Online-within-online meta-learning Proceedings of the 33rd International Conference on Neural Information Processing Systems, (13110-13120)
  143. Daniely A and Granot E Generalization bounds for neural networks via approximate description length Proceedings of the 33rd International Conference on Neural Information Processing Systems, (13008-13016)
  144. Bressan M, Cesa-Bianchi N, Paudice A and Vitale F Correlation clustering with adaptive similarity queries Proceedings of the 33rd International Conference on Neural Information Processing Systems, (12531-12540)
  145. Janner M, Fu J, Zhang M and Levine S When to trust your model Proceedings of the 33rd International Conference on Neural Information Processing Systems, (12519-12530)
  146. Ligett K and Shenfeld M A necessary and sufficient stability notion for adaptive generalization Proceedings of the 33rd International Conference on Neural Information Processing Systems, (11485-11494)
  147. Bassily R, Feldman V, Talwar K and Thakurta A Private stochastic convex optimization with optimal rates Proceedings of the 33rd International Conference on Neural Information Processing Systems, (11282-11291)
  148. Negrea J, Haghifam M, Dziugaite G, Khisti A and Roy D Information-theoretic generalization bounds for SGLD via data-dependent estimates Proceedings of the 33rd International Conference on Neural Information Processing Systems, (11015-11025)
  149. Cao Y and Gu Q Generalization bounds of stochastic gradient descent for wide and deep neural networks Proceedings of the 33rd International Conference on Neural Information Processing Systems, (10836-10846)
  150. Wang B, Mendez J, Cai M and Eaton E Transfer learning via minimizing the performance gap between domains Proceedings of the 33rd International Conference on Neural Information Processing Systems, (10645-10655)
  151. Alon N, Bassily R and Moran S Limits of private learning with access to public data Proceedings of the 33rd International Conference on Neural Information Processing Systems, (10342-10352)
  152. Crane R and Roosta F DINGO Proceedings of the 33rd International Conference on Neural Information Processing Systems, (9498-9508)
  153. Roelofs R, Fridovich-Keil S, Miller J, Shankar V, Hardt M, Recht B and Schmidt L A meta-analysis of overfitting in machine learning Proceedings of the 33rd International Conference on Neural Information Processing Systems, (9179-9189)
  154. Dhar S, Cherkassky V and Shah M Multiclass learning from contradictions Proceedings of the 33rd International Conference on Neural Information Processing Systems, (8400-8410)
  155. Wu S, Dimakis A and Sanghavi S Learning distributions generated by one-layer ReLU networks Proceedings of the 33rd International Conference on Neural Information Processing Systems, (8107-8117)
  156. Wu S, Sanghavi S and Dimakis A Sparse logistic regression learns all discrete pairwise graphical models Proceedings of the 33rd International Conference on Neural Information Processing Systems, (8071-8081)
  157. Loog M, Viering T and Mey A Minimizers of the empirical risk and risk monotonicity Proceedings of the 33rd International Conference on Neural Information Processing Systems, (7478-7487)
  158. Indyk P, Vakilian A and Yuan Y Learning-based low-rank approximations Proceedings of the 33rd International Conference on Neural Information Processing Systems, (7402-7412)
  159. Yehudai G and Shamir O On the power and limitations of random features for understanding neural networks Proceedings of the 33rd International Conference on Neural Information Processing Systems, (6598-6608)
  160. Panageas I, Piliouras G and Wang X First-order methods almost always avoid saddle points Proceedings of the 33rd International Conference on Neural Information Processing Systems, (6474-6483)
  161. Malach E and Shalev-Shwartz S Is deeper better only when shallow is good? Proceedings of the 33rd International Conference on Neural Information Processing Systems, (6429-6438)
  162. Ndiaye E and Takeuchi I Computing full conformal prediction set with approximate homotopy Proceedings of the 33rd International Conference on Neural Information Processing Systems, (1386-1395)
  163. Balcan M, Dick T, Noothigattu R and Procaccia A Envy-free classification Proceedings of the 33rd International Conference on Neural Information Processing Systems, (1240-1250)
  164. ACM
    Haghir Chehreghani M, Bifet A and Abdessalem T Adaptive Algorithms for Estimating Betweenness and k-path Centralities Proceedings of the 28th ACM International Conference on Information and Knowledge Management, (1231-1240)
  165. Tidjon L, Frappier M and Mammar A (2019). Intrusion Detection Systems: A Cross-Domain Overview, IEEE Communications Surveys & Tutorials, 21:4, (3639-3681), Online publication date: 1-Oct-2019.
  166. Roulet V and Harchaoui Z An Elementary Approach to Convergence Guarantees of Optimization Algorithms for Deep Networks 2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton), (84-91)
  167. Weinberger N and Feder M k-vectors: An Alternating Minimization Algorithm for Learning Regression Functions 2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton), (887-894)
  168. Izbicki M, Papalexakis E and Tsotras V Exploiting the Earth’s Spherical Geometry to Geolocate Images Machine Learning and Knowledge Discovery in Databases, (3-19)
  169. Fanizza M, Mari A and Giovannetti V (2019). Optimal Universal Learning Machines for Quantum State Discrimination, IEEE Transactions on Information Theory, 65:9, (5931-5944), Online publication date: 1-Sep-2019.
  170. ACM
    Kleinberg R, Slivkins A and Upfal E (2019). Bandits and Experts in Metric Spaces, Journal of the ACM, 66:4, (1-77), Online publication date: 26-Aug-2019.
  171. Rostami M, Kolouri S and Pilly P Complementary learning for overcoming catastrophic forgetting using experience replay Proceedings of the 28th International Joint Conference on Artificial Intelligence, (3339-3345)
  172. Huai M, Xue H, Miao C, Yao L, Su L, Chen C and Zhang A Deep metric learning Proceedings of the 28th International Joint Conference on Artificial Intelligence, (2535-2541)
  173. Chen H, Mo Z, Yang Z and Wang X Theoretical investigation of generalization bound for residual networks Proceedings of the 28th International Joint Conference on Artificial Intelligence, (2081-2087)
  174. Dong J, Elzayn H, Jabbari S, Kearns M and Schutzman Z Equilibrium characterization for data acquisition games Proceedings of the 28th International Joint Conference on Artificial Intelligence, (252-258)
  175. Moulay E, Léchappé V and Plestan F (2019). Properties of the sign gradient descent algorithms, Information Sciences: an International Journal, 492:C, (29-39), Online publication date: 1-Aug-2019.
  176. ACM
    Tang F, Xiao C, Wang F, Zhou J and Lehman L Retaining Privileged Information for Multi-Task Learning Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, (1369-1377)
  177. ACM
    Yang E, Lewis D and Frieder O Text Retrieval Priors for Bayesian Logistic Regression Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval, (1045-1048)
  178. Budiu M, Gopalan P, Suresh L, Wieder U, Kruiger H and Aguilera M (2019). Hillview, Proceedings of the VLDB Endowment, 12:11, (1442-1457), Online publication date: 1-Jul-2019.
  179. ACM
    Li S, Chen L and Kumar A Enabling and Optimizing Non-linear Feature Interactions in Factorized Linear Algebra Proceedings of the 2019 International Conference on Management of Data, (1571-1588)
  180. ACM
    Li F, Chen L, Zeng Y, Kumar A, Wu X, Naughton J and Patel J Tuple-oriented Compression for Large-scale Mini-batch Stochastic Gradient Descent Proceedings of the 2019 International Conference on Management of Data, (1517-1534)
  181. ACM
    Barceló P, Baumgartner A, Dalmau V and Kimelfeld B Regularizing Conjunctive Features for Classification Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, (2-16)
  182. van Bergerem S Learning concepts definable in first-order logic with counting Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, (1-13)
  183. ACM
    Alon N, Livni R, Malliaris M and Moran S Private PAC learning implies finite Littlestone dimension Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, (852-860)
  184. ACM
    Ben-Porat O and Tennenholtz M Regression Equilibrium Proceedings of the 2019 ACM Conference on Economics and Computation, (173-191)
  185. ACM
    Yang E, Lewis D and Frieder O A Regularization Approach to Combining Keywords and Training Data in Technology-Assisted Review Proceedings of the Seventeenth International Conference on Artificial Intelligence and Law, (153-162)
  186. Ho C and Parpas P (2019). Empirical risk minimization, Computational Optimization and Applications, 73:2, (387-410), Online publication date: 1-Jun-2019.
  187. ACM
    Su L and Xu J (2019). Securing Distributed Gradient Descent in High Dimensional Statistical Learning, Proceedings of the ACM on Measurement and Analysis of Computing Systems, 3:1, (1-41), Online publication date: 26-Mar-2019.
  188. Liu K and Bellet A (2022). Escaping the curse of dimensionality in similarity learning, Neurocomputing, 333:C, (185-199), Online publication date: 14-Mar-2019.
  189. ACM
    Toolpeng S, Wannapoporn K and Phanomchoeng G Thai License Plate Recognition Algorithm with Service Routine Procedure for Automatic Barrier Gate Proceedings of the 2019 3rd International Conference on Virtual and Augmented Reality Simulations, (77-81)
  190. Liu W, Xu D, Tsang I and Zhang W (2019). Metric Learning for Multi-Output Tasks, IEEE Transactions on Pattern Analysis and Machine Intelligence, 41:2, (408-422), Online publication date: 1-Feb-2019.
  191. Ye H, Zhan D and Jiang Y (2019). Fast generalization rates for distance metric learning, Machine Language, 108:2, (267-295), Online publication date: 1-Feb-2019.
  192. ACM
    Schnabel T, Bennett P and Joachims T Shaping Feedback Data in Recommender Systems with Interventions Based on Information Foraging Theory Proceedings of the Twelfth ACM International Conference on Web Search and Data Mining, (546-554)
  193. Wang J and Geng X Theoretical analysis of label distribution learning Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence and Thirty-First Innovative Applications of Artificial Intelligence Conference and Ninth AAAI Symposium on Educational Advances in Artificial Intelligence, (5256-5263)
  194. Senderovich A, Beck J, Gal A and Weidlich M Congestion graphs for automated time predictions Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence and Thirty-First Innovative Applications of Artificial Intelligence Conference and Ninth AAAI Symposium on Educational Advances in Artificial Intelligence, (4854-4861)
  195. Adel T, Valera I, Ghahramani Z and Weller A One-network adversarial fairness Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence and Thirty-First Innovative Applications of Artificial Intelligence Conference and Ninth AAAI Symposium on Educational Advances in Artificial Intelligence, (2412-2420)
  196. ACM
    Oneto L, Doninini M, Elders A and Pontil M Taking Advantage of Multitask Learning for Fair Classification Proceedings of the 2019 AAAI/ACM Conference on AI, Ethics, and Society, (227-237)
  197. Harms N Testing halfspaces over rotation-invariant distributions Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, (694-713)
  198. Bietti A and Mairal J (2019). Group invariance, stability to deformations, and complexity of deep convolutional representations, The Journal of Machine Learning Research, 20:1, (876-924), Online publication date: 1-Jan-2019.
  199. ACM
    Kim A, Choi W, Park J, Kim K and Lee U (2018). Interrupting Drivers for Interactions, Proceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies, 2:4, (1-28), Online publication date: 27-Dec-2018.
  200. ACM
    Shaw N, Stöckel A, Orr R, Lidbetter T and Cohen R Towards Provably Moral AI Agents in Bottom-up Learning Frameworks Proceedings of the 2018 AAAI/ACM Conference on AI, Ethics, and Society, (271-277)
  201. Rioux-Paradis K, Gaudreault J, Redmond C, Otomo-Lauzon K, Bernard F, Deschênes A, Quimper C, Boivin S and Blouin P Learning from historical data to predict electric vehicle taxi consumption and charging time Proceedings of the 2018 Winter Simulation Conference, (1216-1217)
  202. Asadi A, Abbe E and Verdú S Chaining mutual information and tightening generalization bounds Proceedings of the 32nd International Conference on Neural Information Processing Systems, (7245-7254)
  203. Bassily R, Thakkar O and Thakurta A Model-agnostic private learning Proceedings of the 32nd International Conference on Neural Information Processing Systems, (7102-7112)
  204. Samadi S, Tantipongpipat U, Morgenstern J, Singh M and Vempala S The price of fair PCA Proceedings of the 32nd International Conference on Neural Information Processing Systems, (10999-11010)
  205. Le T and Yamada M Persistence fisher kernel Proceedings of the 32nd International Conference on Neural Information Processing Systems, (10028-10039)
  206. Foster D, Sekhari A and Sridharan K Uniform convergence of gradients for non-convex learning and optimization Proceedings of the 32nd International Conference on Neural Information Processing Systems, (8759-8770)
  207. Ishida T, Niu G and Sugiyama M Binary classification from positive-confidence data Proceedings of the 32nd International Conference on Neural Information Processing Systems, (5921-5932)
  208. Schmidt L, Santurkar S, Tsipras D, Talwar K and Madry A Adversarially robust generalization requires more data Proceedings of the 32nd International Conference on Neural Information Processing Systems, (5019-5031)
  209. Reeb D, Doerr A, Gerwinn S and Rakitsch B Learning Gaussian processes by minimizing PAC-Bayesian generalization bounds Proceedings of the 32nd International Conference on Neural Information Processing Systems, (3341-3351)
  210. Donini M, Oneto L, Ben-David S, Shawe-Taylor J and Pontil M Empirical risk minimization under fairness constraints Proceedings of the 32nd International Conference on Neural Information Processing Systems, (2796-2806)
  211. Wang S, Roosta-Khorasani F, Xu P and Mahoney M GIANT Proceedings of the 32nd International Conference on Neural Information Processing Systems, (2338-2348)
  212. Belkin M, Hsu D and Mitra P Overfitting or perfect fitting? risk bounds for classification and regression rules that interpolate Proceedings of the 32nd International Conference on Neural Information Processing Systems, (2306-2317)
  213. Cullina D, Bhagoji A and Mittal P PAC-learning in the presence of evasion adversaries Proceedings of the 32nd International Conference on Neural Information Processing Systems, (228-239)
  214. Xu Y and Wang X Understanding weight normalized deep neural networks with rectified linear units Proceedings of the 32nd International Conference on Neural Information Processing Systems, (130-139)
  215. ACM
    Alon U, Zilberstein M, Levy O and Yahav E (2018). A general path-based representation for predicting program properties, ACM SIGPLAN Notices, 53:4, (404-419), Online publication date: 2-Dec-2018.
  216. ACM
    Kimelfeld B and Ré C (2018). A Relational Framework for Classifier Engineering, ACM Transactions on Database Systems, 43:3, (1-36), Online publication date: 26-Nov-2018.
  217. ACM
    Riondato M and Upfal E (2018). ABRA, ACM Transactions on Knowledge Discovery from Data, 12:5, (1-38), Online publication date: 31-Oct-2018.
  218. Boyer J Natural language question answering in the financial domain Proceedings of the 28th Annual International Conference on Computer Science and Software Engineering, (189-200)
  219. ACM
    Kimelfeld B and Ré C (2018). A Relational Framework for Classifier Engineering, ACM SIGMOD Record, 47:1, (6-13), Online publication date: 10-Sep-2018.
  220. Miyaguchi K and Yamanishi K (2018). High-dimensional penalty selection via minimum description length principle, Machine Language, 107:8-10, (1283-1302), Online publication date: 1-Sep-2018.
  221. ACM
    Riondato M and Vandin F MiSoSouP Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, (2130-2139)
  222. ACM
    Huai M, Miao C, Li Y, Suo Q, Su L and Zhang A Metric Learning from Probabilistic Labels Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, (1541-1550)
  223. Liang D and Li Y Lightweight label propagation for large-scale network data Proceedings of the 27th International Joint Conference on Artificial Intelligence, (3421-3427)
  224. Shvai N, Meicler A, Hasnat A, Machover E, Maarek P, Loquet S and Nakib A Optimal Ensemble Classifiers Based Classification for Automatic Vehicle Type Recognition 2018 IEEE Congress on Evolutionary Computation (CEC), (1-8)
  225. ACM
    Alon U, Zilberstein M, Levy O and Yahav E A general path-based representation for predicting program properties Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation, (404-419)
  226. Melki G, Kecman V, Ventura S and Cano A (2018). OLLAWV, Applied Soft Computing, 66:C, (384-393), Online publication date: 1-May-2018.
  227. Huynh N, Ng W and Ariyapala K (2018). Learning under concept drift with follow the regularized leader and adaptive decaying proximal, Expert Systems with Applications: An International Journal, 96:C, (49-63), Online publication date: 15-Apr-2018.
  228. Kuck J, Sabharwal A and Ermon S Approximate inference via weighted rademacher complexity Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence and Thirtieth Innovative Applications of Artificial Intelligence Conference and Eighth AAAI Symposium on Educational Advances in Artificial Intelligence, (6376-6383)
  229. Shen X, Liu W, Tsang I, Sun Q and Ong Y Compact multi-label learning Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence and Thirtieth Innovative Applications of Artificial Intelligence Conference and Eighth AAAI Symposium on Educational Advances in Artificial Intelligence, (4066-4073)
  230. Lehnert L, Laroche R and van Seijen H On value function representation of long horizon problems Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence and Thirtieth Innovative Applications of Artificial Intelligence Conference and Eighth AAAI Symposium on Educational Advances in Artificial Intelligence, (3457-3465)
  231. ACM
    Hope T and Shahaf D Ballpark Crowdsourcing Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining, (234-242)
  232. ACM
    Tripathi S and Hemachandra N Scalable linear classifiers based on exponential loss function Proceedings of the ACM India Joint International Conference on Data Science and Management of Data, (190-200)
  233. ACM
    Sahu P and Hemachandra N Some new PAC-Bayesian bounds and their use in selection of regularization parameter for linear SVMs Proceedings of the ACM India Joint International Conference on Data Science and Management of Data, (240-248)
  234. Arunachalam S and De Wolf R (2018). Optimal quantum sample complexity of learning algorithms, The Journal of Machine Learning Research, 19:1, (2879-2878), Online publication date: 1-Jan-2018.
  235. Park W, You Y, Lee K and You I (2018). Detecting Potential Insider Threat, Security and Communication Networks, 2018, Online publication date: 1-Jan-2018.
  236. Wu X, Hu G and Alonso-Betanzos A (2018). Generalization Bounds for Coregularized Multiple Kernel Learning, Computational Intelligence and Neuroscience, 2018, Online publication date: 1-Jan-2018.
  237. ACM
    Doan T, Beck C and Srikant R (2017). On the Convergence Rate of Distributed Gradient Methods for Finite-Sum Optimization under Communication Delays, Proceedings of the ACM on Measurement and Analysis of Computing Systems, 1:2, (1-27), Online publication date: 19-Dec-2017.
  238. Balkanski E, Syed U and Vassilvitskii S Statistical cost sharing Proceedings of the 31st International Conference on Neural Information Processing Systems, (6222-6231)
  239. Bietti A and Mairal J Invariance and stability of deep convolutional representations Proceedings of the 31st International Conference on Neural Information Processing Systems, (6211-6221)
  240. Neyshabur B, Bhojanapalli S, McAllester D and Srebro N Exploring generalization in deep learning Proceedings of the 31st International Conference on Neural Information Processing Systems, (5949-5958)
  241. Syrgkanis V A sample complexity measure with applications to learning optimal auctions Proceedings of the 31st International Conference on Neural Information Processing Systems, (5358-5365)
  242. Sheth R and Khardon R Excess risk bounds for the bayes risk using variational inference in latent Gaussian models Proceedings of the 31st International Conference on Neural Information Processing Systems, (5157-5167)
  243. Baltaoglu S, Tong L and Zhao Q Online learning of optimal bidding strategy in repeated multi-commodity auctions Proceedings of the 31st International Conference on Neural Information Processing Systems, (4510-4520)
  244. Backurs A, Indyk P and Schmidt L On the fine-grained complexity of empirical risk minimization: kernel methods and neural networks Proceedings of the 31st International Conference on Neural Information Processing Systems, (4311-4321)
  245. Hoy D, Nekipelov D and Syrgkanis V Welfare guarantees from data Proceedings of the 31st International Conference on Neural Information Processing Systems, (3771-3780)
  246. Staib M, Claici S, Solomon J and Jegelka S Parallel streaming Wasserstein barycenters Proceedings of the 31st International Conference on Neural Information Processing Systems, (2644-2655)
  247. Xu A and Raginsky M Information-theoretic analysis of generalization capability of learning algorithms Proceedings of the 31st International Conference on Neural Information Processing Systems, (2521-2530)
  248. Goel S and Klivans A Eigenvalue decay implies polynomial-time learnability for neural networks Proceedings of the 31st International Conference on Neural Information Processing Systems, (2189-2199)
  249. Kiryo R, Niu G, du Plessis M and Sugiyama M Positive-unlabeled learning with non-negative risk estimator Proceedings of the 31st International Conference on Neural Information Processing Systems, (1674-1684)
  250. Kontorovich A, Sabato S and Weiss R Nearest-neighbor sample compression Proceedings of the 31st International Conference on Neural Information Processing Systems, (1572-1582)
  251. Ben-Porat O and Tennenholtz M Best response regression Proceedings of the 31st International Conference on Neural Information Processing Systems, (1498-1507)
  252. Balkanski E and Singer Y Minimizing a submodular function from samples Proceedings of the 31st International Conference on Neural Information Processing Systems, (814-822)
  253. Shah V, Kumar A and Zhu X (2017). Are key-foreign key joins safe to avoid when learning high-capacity classifiers?, Proceedings of the VLDB Endowment, 11:3, (366-379), Online publication date: 1-Nov-2017.
  254. ACM
    Chatbri H, McGuinness K, Little S, Zhou J, Kameyama K, Kwan P and O'Connor N Automatic MOOC Video Classification using Transcript Features and Convolutional Neural Networks Proceedings of the 2017 ACM Workshop on Multimedia-based Educational and Knowledge Technologies for Personalized and Social Online Training, (21-26)
  255. Poggio T, Mhaskar H, Rosasco L, Miranda B and Liao Q (2017). Why and when can deep-but not shallow-networks avoid the curse of dimensionality, International Journal of Automation and Computing, 14:5, (503-519), Online publication date: 1-Oct-2017.
  256. Fish B and Reyzin L On the complexity of learning from label proportions Proceedings of the 26th International Joint Conference on Artificial Intelligence, (1675-1681)
  257. Sokolić J, Giryes R, Sapiro G and Rodrigues M (2017). Robust Large Margin Deep Neural Networks, IEEE Transactions on Signal Processing, 65:16, (4265-4280), Online publication date: 15-Aug-2017.
  258. Wu X and Zhou Z A unified view of multi-label performance measures Proceedings of the 34th International Conference on Machine Learning - Volume 70, (3780-3788)
  259. Shalit U, Johansson F and Sontag D Estimating individual treatment effect Proceedings of the 34th International Conference on Machine Learning - Volume 70, (3076-3085)
  260. McNamara D and Balcan M Risk bounds for transferring representations with and without fine-tuning Proceedings of the 34th International Conference on Machine Learning - Volume 70, (2373-2381)
  261. Gottlieb L, Kontorovich A and Krauthgamer R (2017). Efficient Regression in Metric Spaces via Approximate Lipschitz Extension, IEEE Transactions on Information Theory, 63:8, (4838-4849), Online publication date: 1-Aug-2017.
  262. Arunachalam S and de Wolf R Optimal quantum sample complexity of learning algorithms Proceedings of the 32nd Computational Complexity Conference, (1-31)
  263. ACM
    AlGhamdi Z, Jamour F, Skiadopoulos S and Kalnis P A Benchmark for Betweenness Centrality Approximation Algorithms on Large Graphs Proceedings of the 29th International Conference on Scientific and Statistical Database Management, (1-12)
  264. Grohe M and Ritzert M Learning first-order definable concepts over structures of small degree Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, (1-12)
  265. ACM
    Arunachalam S and de Wolf R (2017). Guest Column, ACM SIGACT News, 48:2, (41-67), Online publication date: 12-Jun-2017.
  266. Li Z, Zhang B, Ren S, Liu Y, Qin Z, Goh R and Gurusamy M Performance Modelling and Cost Effective Execution for Distributed Graph Processing on Configurable VMs Proceedings of the 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing, (74-83)
  267. ACM
    Kaoudi Z, Quiane-Ruiz J, Thirumuruganathan S, Chawla S and Agrawal D A Cost-based Optimizer for Gradient Descent Optimization Proceedings of the 2017 ACM International Conference on Management of Data, (977-992)
  268. ACM
    Kimelfeld B and Ré C A Relational Framework for Classifier Engineering Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, (5-20)
  269. ACM
    Dwork C, Feldman V, Hardt M, Pitassi T, Reingold O and Roth A (2017). Guilt-free data reuse, Communications of the ACM, 60:4, (86-93), Online publication date: 24-Mar-2017.
  270. Yoon J, Alaa A, Cadeiras M and Schaar M Personalized donor-recipient matching for organ transplantation Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, (1647-1654)
  271. Feldman V, Guzmán C and Vempala S Statistical query algorithms for mean vector estimation and stochastic convex optimization Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, (1265-1277)
  272. Gonen A and Shalev-Shwartz S (2017). Average stability is invariant to data preconditioning, The Journal of Machine Learning Research, 18:1, (8245-8257), Online publication date: 1-Jan-2017.
  273. Kontorovich A, Sabato S and Urner R (2017). Active nearest-neighbor learning in metric spaces, The Journal of Machine Learning Research, 18:1, (7095-7132), Online publication date: 1-Jan-2017.
  274. Abbe E (2017). Community detection and stochastic block models, The Journal of Machine Learning Research, 18:1, (6446-6531), Online publication date: 1-Jan-2017.
  275. Huang R, Lattimore T, György A and Szepesvári C (2017). Following the leader and fast rates in online linear prediction, The Journal of Machine Learning Research, 18:1, (5325-5355), Online publication date: 1-Jan-2017.
  276. Hamm J (2017). Minimax filter, The Journal of Machine Learning Research, 18:1, (4704-4734), Online publication date: 1-Jan-2017.
  277. Kleindessner M and Von Luxburg U (2017). Lens depth function and k-relative neighborhood graph: versatile tools for ordinal data analysis, The Journal of Machine Learning Research, 18:1, (1889-1940), Online publication date: 1-Jan-2017.
  278. Gottlieb L, Kontorovich A and Nisnevitch P (2017). Nearly optimal classification for semimetrics, The Journal of Machine Learning Research, 18:1, (1233-1254), Online publication date: 1-Jan-2017.
  279. Bach F (2017). On the equivalence between kernel quadrature rules and random feature expansions, The Journal of Machine Learning Research, 18:1, (714-751), Online publication date: 1-Jan-2017.
  280. Bach F (2017). Breaking the curse of dimensionality with convex neural networks, The Journal of Machine Learning Research, 18:1, (629-681), Online publication date: 1-Jan-2017.
  281. Huang R, Lattimore T, György A and Szepesvári C Following the leader and fast rates in linear prediction Proceedings of the 30th International Conference on Neural Information Processing Systems, (4976-4984)
  282. Pentina A and Urner R Lifelong learning with weighted majority votes Proceedings of the 30th International Conference on Neural Information Processing Systems, (3619-3627)
  283. Feldman V Generalization of ERM in stochastic convex optimization Proceedings of the 30th International Conference on Neural Information Processing Systems, (3583-3591)
  284. David O, Moran S and Yehudayoff A On statistical learning via the lens of compression Proceedings of the 30th International Conference on Neural Information Processing Systems, (2792-2800)
  285. Daniely A, Frostig R and Singer Y Toward deeper understanding of neural networks Proceedings of the 30th International Conference on Neural Information Processing Systems, (2261-2269)
  286. Namkoong H and Duchi J Stochastic gradient methods for distributionally robust optimization with f-divergences Proceedings of the 30th International Conference on Neural Information Processing Systems, (2216-2224)
  287. Shamir O Without-replacement sampling for stochastic gradient methods Proceedings of the 30th International Conference on Neural Information Processing Systems, (46-54)
  288. Alabdulmohsin I, Cisse M and Zhang X Is Attribute-Based Zero-Shot Learning anźIll-Posed Strategy? European Conference on Machine Learning and Knowledge Discovery in Databases - Volume 9851, (749-760)
  289. Matsushima S Asynchronous Feature Extraction for Large-Scale Linear Predictors European Conference on Machine Learning and Knowledge Discovery in Databases - Volume 9851, (604-618)
  290. ACM
    Moran S and Yehudayoff A (2016). Sample Compression Schemes for VC Classes, Journal of the ACM, 63:3, (1-10), Online publication date: 1-Sep-2016.
  291. ACM
    Riondato M and Upfal E ABRA Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, (1145-1154)
  292. Naidu R, Jampana P and Sastry C (2016). Deterministic Compressed Sensing Matrices: Construction via Euler Squares and Applications, IEEE Transactions on Signal Processing, 64:14, (3566-3575), Online publication date: 15-Jul-2016.
  293. ACM
    Kumar A, Naughton J, Patel J and Zhu X To Join or Not to Join? Proceedings of the 2016 International Conference on Management of Data, (19-34)
  294. Kocak M, Erkip E and Shasha D Conjugate conformal prediction for online binary classification Proceedings of the Thirty-Second Conference on Uncertainty in Artificial Intelligence, (347-356)
  295. Azar M, Dyer E and Körding K Convex relaxation regression Proceedings of the Thirty-Second Conference on Uncertainty in Artificial Intelligence, (22-31)
  296. ACM
    Hsu J, Morgenstern J, Rogers R, Roth A and Vohra R Do prices coordinate markets? Proceedings of the forty-eighth annual ACM symposium on Theory of Computing, (440-453)
  297. Cheng H, Hsieh M and Yeh P (2016). The learnability of unknown quantum measurements, Quantum Information & Computation, 16:7-8, (615-656), Online publication date: 1-May-2016.
  298. ACM
    Gupta R and Roughgarden T A PAC Approach to Application-Specific Algorithm Selection Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, (123-134)
  299. Bubeck S (2015). Convex Optimization, Foundations and Trends® in Machine Learning, 8:3-4, (231-357), Online publication date: 1-Nov-2015.
  300. ACM
    Li Y, Chow C, Deng K, Yuan M, Zeng J, Zhang J, Yang Q and Zhang Z Sampling Big Trajectory Data Proceedings of the 24th ACM International on Conference on Information and Knowledge Management, (941-950)
  301. ACM
    Cock M, Dowsley R, Nascimento A and Newman S Fast, Privacy Preserving Linear Regression over Distributed Datasets based on Pre-Distributed Data Proceedings of the 8th ACM Workshop on Artificial Intelligence and Security, (3-14)
  302. ACM
    Berlin K, Slater D and Saxe J Malicious Behavior Detection using Windows Audit Logs Proceedings of the 8th ACM Workshop on Artificial Intelligence and Security, (35-44)
  303. Darnstädt M, Ries C and Simon H Hierarchical Design of Fast Minimum Disagreement Algorithms Proceedings of the 26th International Conference on Algorithmic Learning Theory - Volume 9355, (134-148)
  304. Kushagra S and Ben-David S Information Preserving Dimensionality Reduction Proceedings of the 26th International Conference on Algorithmic Learning Theory - Volume 9355, (239-253)
  305. ACM
    Riondato M and Upfal E VC-Dimension and Rademacher Averages Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, (2321-2322)
  306. ACM
    Riondato M and Upfal E Mining Frequent Itemsets through Progressive Sampling with Rademacher Averages Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, (1005-1014)
  307. ACM
    Dwork C, Feldman V, Hardt M, Pitassi T, Reingold O and Roth A Preserving Statistical Validity in Adaptive Data Analysis Proceedings of the forty-seventh annual ACM symposium on Theory of Computing, (117-126)
  308. ACM
    Pellegrina L and Vandin F SILVAN: Estimating Betweenness Centralities with Progressive Sampling and Non-uniform Rademacher Bounds, ACM Transactions on Knowledge Discovery from Data, 0:0
  309. ACM
    Xiong P, Tegegn M, Sarin J, Pal S and Rubin J It Is All About Data: A Survey on the Effects of Data on Adversarial Robustness, ACM Computing Surveys, 0:0
  310. Senigagliesi L, Baldi M and Gambi E Statistical and Machine Learning-Based Decision Techniques for Physical Layer Authentication 2019 IEEE Global Communications Conference (GLOBECOM), (1-6)
  311. Oliveira M, Barwaldt R, Pias M and Espíndola D Understanding the Student Dropout in Distance Learning 2019 IEEE Frontiers in Education Conference (FIE), (1-7)
Contributors
  • Hebrew University of Jerusalem
  • David R. Cheriton School of Computer Science

Index Terms

  1. Understanding Machine Learning: From Theory to Algorithms

      Recommendations

      Denilson Barbosa

      Understanding machine learning is a most welcome breath of fresh air into the libraries of machine learning enthusiasts and students. Unlike all other previous texts, this book dives deep into the theory first, looking at foundational and hard questions, before moving on to specific algorithms. The narrative, always formal and sometimes terse, uses illustrative and fairly intuitive examples to get the message across very effectively. Proofs are explained in detail, and each chapter ends with a good list of exercises. The book starts with a brief and crisp philosophical discussion framing the subject of the book, statistical learning from data, and then dives into foundational questions: What is learning__?__ What can be effectively learned__?__ At what cost__?__ These issues are discussed in the first few chapters of the book, which provide a formal model of learning (the classical probably approximately correct (PAC) model), and a universal learning framework. Also in this introductory section, other often-ignored yet foundational concepts, such as the no-free-lunch theorem and the computational cost associated with learning, are rigorously discussed. Next, the book devotes quite a lot of space to the wealth of successful learning methods in the literature, covering them in light of the theoretical background laid out in the first section. As a result, the exposition is crisp, taking the reader immediately to the nitty-gritty of the matter. All familiar methods are covered, from linear predictors to kernels, support vector machines, decision trees, and neural networks, as well as other popular topics such as boosting, gradient descent, multiclass, and ranking problems. The book has two other sections: one covering additional topics and the other delving deeper into the theory. Among the additional topics, the chapters on clustering, feature selection, and dimensionality reduction were particularly interesting. In summary, this is a thorough and very well-crafted textbook, aimed at graduate students and researchers, but accessible to senior undergrads as well. It clearly synthesizes the field in a much more elegant way compared to previous books, which often are essentially collections of research papers edited into fairly disconnected chapters. As such, it is a more than welcome addition and a very strong contender to be the standard textbook in machine learning for years to come. More reviews about this item: Amazon Online Computing Reviews Service

      Access critical reviews of Computing literature here

      Become a reviewer for Computing Reviews.