We will have meeting on Friday afternoon at 524/526, starting from 3:20pm.
5/1 (Fri.) Scan presents the rest of SMO linear convergence.
5/8 (Fri.) Kai-Min presents Sparse Online Learning via Truncated Gradient.
5/14 (Thu.) Janet presetns her work “Maximum Entropy”.
5/21 (Thu.) Ho Chia-Hua presents A Dual Coordinate Descent Method for Large-scale Linear SVM
6/5 (Fri.) Kai-Min presents Yin-Wen's thesis.
5/29 (Thu.) Janet presents pipibjc's thesis.
6/4 (Thu.) Kai-Min presents Yin-Wen's thesis.
6/5 (Fri.) Chen-Tse,博瀚 presents eaudex's thesis.
6/12 (Fri.) Kai-Min presetns the rest of Sparse Online Learning via Truncated Gradient.
6/19 (Fri.) Tian-Liang presetns Learning to Classify with Missing and Corrupted Features .
6/26 (Fri.) pipibjc presetns LYin-Wen's thesis.
7/2 (Thu.) Tian-Liang presetns the rest of Learning to Classify with Missing and Corrupted Features .
7/9 (Thu.) Dino presents his research
7/10 (Fri.) Chia Hua presents An Interior-Point Method for Large-Scale l1-Regularized Logistic Regression
7/16 (Thu.) Scan presetns Stochastic Methods for L1 Regularized Loss Minimization.
7/17 (Fri.) Chia Hua presents An Interior-Point Method for Large-Scale l1-Regularized Logistic Regression
7/23 (Thu.) 2nd-year master students presents their work
7/24 (Fri.) Others present their work
7/30 (Thu.) Chen-Tse 博瀚 presents svvd
8/6 (Thu.) Kai-Min presents A Note on Decomposition Methods for Support Vector Regression
8/7 (Fri.) Typhoon 莫拉克
8/13 (Thu.) Chia Hua presents arge Linear Classification when Data Cannot Fit in Memory
8/14 (Fri.) Tian-Liang presents Learning Linear Dynamical Systems without Sequence Information
8/21 (Fri.) Chen-Tse presents Tree Decomposition for Large-Scale Support Vector Machines
8/27 (Thu.) Scan presents Hash Kernels for Structured Data
8/28 (Fri.) Po-Han presents Feature Hashing for Large Scale Multitask Learning
9/3 (Thu.) Kai-Min presents Trust region Newton method for large-scale logistic regression
9/4 (Fri.) Tian-Liang presents
9/10 (Thu.) Chen-Tse presents Dual Augmented Lagrangian Method for Efficent Sparse Reconstruction
9/11 (Fri.) Po-Han presents Fast Solution of L1-morm Minimization Problems When the Solution May be Sparse
?? (??) ?? Bundle Methods for Regularized Risk Minimization.