 机器学习是数据分析与挖掘的一种手段  机器学习是什么？  利用经验改善系统自身的性能  关于T和P，程序对E进行学习  Looking for a function  机器学习发展史  人工智能三阶段：推理期、知识期、学习期  深度学习∈机器学习∈人工智能  机器学习基本术语  回归、分类；模型、学习器；样本、样例……  模型选择：奥卡姆剃刀？NFL？

1 Introduction 2 Unsupervised Hashing 3 Supervised Hashing 4 Ranking-based Hashing 5 Multimodal Hashing 6 Deep Hashing 7 Quantization 8 Conclusion 9 Reference

1 Introduction 2 Learning to Hash Isotropic Hashing Scalable Graph Hashing with Feature Transformation Supervised Hashing with Latent Factor Models Column Sampling based Discrete Supervised Hashing Deep Supervised Hashing with Pairwise Labels Supervised Multimodal Hashing with SCM Multiple-Bit Quantization 3 Distributed Learning Coupled Group Lasso for Web-Scale CTR Prediction Distributed Power-Law Graph Computing 4 Stochastic Learning Fast Asynchronous Parallel Stochastic Gradient Descent Distributed Stochastic ADMM for Matrix Factorization 5 Conclusion

1 Introduction Problem Definition Existing Methods 2 Scalable Graph Hashing with Feature Transformation Motivation Model and Learning Experiment 3 Conclusion 4 Reference

1 Introduction Problem Definition Existing Methods 2 Isotropic Hashing 3 Supervised Hashing with Latent Factor Model 4 Supervised Multimodal Hashing with SCM 5 Multiple-Bit Quantization Double-Bit Quantization Manhattan Quantization 6 Conclusion 7 Reference

1 Introduction 2 Learning to Hash Isotropic Hashing Supervised Hashing with Latent Factor Models Supervised Multimodal Hashing with SCM Multiple-Bit Quantization 3 Distributed Learning Coupled Group Lasso for Web-Scale CTR Prediction Distributed Power-Law Graph Computing 4 Stochastic Learning Distributed Stochastic ADMM

1 Introduction Problem Definition Existing Methods 2 Isotropic Hashing Model Learning Experiment 3 Multiple-Bit Quantization Double-Bit Quantization Manhattan Quantization 4 Conclusion 5 Reference

1 Introduction Problem Definition Existing Methods Motivation and Contribution 2 Isotropic Hashing Model Learning Experimental Results 3 Multiple-Bit Quantization Double-Bit Quantization Manhattan Quantization 4 Conclusion 5 Reference

1 Introduction 2 AsySVRG 3 SCOPE 4 Conclusion

I. Program Analysis II. Data Flow Analysis ✓ Available Expressions ✓ Liveness Analysis ✓ Reaching Definitions ✓ Very Busy Expressions III.Theory Behind IV. Sensitivity V. Summary