MLSP-32: Optimization Algorithms for Machine Learning |
| Session Type: Poster |
| Time: Thursday, 10 June, 15:30 - 16:15 |
| Location: Gather.Town |
| Virtual Session: View on Virtual Platform |
| Session Chair: Subhro Das, IBM Research |
| MLSP-32.1: SOLVING A CLASS OF NON-CONVEX MIN-MAX GAMES USING ADAPTIVE MOMENTUM METHODS |
| Babak Barazandeh; Splunk |
| Davoud Ataee Tarzanagh; University of Florida |
| George Michailidis; University of Florida |
| MLSP-32.2: MINIMIZING WEIGHTED CONCAVE IMPURITY PARTITION UNDER CONSTRAINTS |
| Thuan Nguyen; Oregon State University |
| Thinh Nguyen; Oregon State University |
| MLSP-32.3: CONSTANT APPROXIMATION ALGORITHM FOR MINIMIZING CONCAVE IMPURITY |
| Thuan Nguyen; Oregon State University |
| Hoang Le; Oregon State University |
| Thinh Nguyen; Oregon State University |
| MLSP-32.4: FUSING MULTITASK MODELS BY RECURSIVE LEAST SQUARES |
| Xiaobin Li; University of Chinese Academy of Sciences |
| Lianlei Shan; University of Chinese Academy of Sciences |
| Weiqiang Wang; University of Chinese Academy of Sciences |
| MLSP-32.5: CENTRALITY BASED NUMBER OF CLUSTER ESTIMATION IN GRAPH CLUSTERING |
| Mahdi Shamsi; Ryerson University |
| Soosan Beheshti; Ryerson University |
| MLSP-32.6: DEPENDENCE-GUIDED MULTI-VIEW CLUSTERING |
| Xia Dong; Northwestern Polytechnical University |
| Danyang Wu; Northwestern Polytechnical University |
| Feiping Nie; Northwestern Polytechnical University |
| Rong Wang; Northwestern Polytechnical University |
| Xuelong Li; Northwestern Polytechnical University |