 |
Zhihui Zhu
|
We are seeking Ph.D. students in Machine Learning (particularly analyses and practical techniques for deep learning, generative models, and LLMs), Signal Processing, and Quantum Information and Computing. Welcome candidates from any background, e.g., EECS, math, physics.
Our group works on theoretical and computational aspects of data science and machine learning, with a focus on developing efficient methods for extracting useful information from large-scale and high-dimensional data, proving their correctness, and applying them to solving real-world problems. A few current projects include
Call for papers: IEEE JSTSP Special Issue on Seeking Low-dimensionality in Deep Neural Networks (SLowDNN); manuscript due: November 30, 2023
Call for papers: Conference on Parsimony and Learning (CPAL), January 2024, Hongkong
News:
[Dec 2023] Paper release: Check out our survey on techniques for improving the efficiency of LLMs The Efficiency Spectrum of Large Language Models: An Algorithmic Survey, github repo
[Dec 2023] Paper release: DREAM: Diffusion Rectification and Estimation-Adaptive Models, project page
[Jun 2023] Our collaborative proposal (with Jere at JHU and Qing at UMich) on Deep Neural Collapse has been awarded by NSF!
[Jun 2023] Gave a short course on ‘‘Learning Nonlinear and Deep Low-Dimensional Representations from High-Dimensional Data: From Theory to Practice" at ICASSP 2023.
[Jan 2023] Co-organized and gave a tutorail at the 3rd SLowDNN Workshop at MBZUAI, Abu Dhabi, MBZUAI.
[Dec 2022] Received CQISE Partnership Seed Award (PSA) and will collaborate with Brian Kirby (ARL) on quantum network.
[Dec 2022] Invited to serve as area chair at ICML 2023.
[Nov 2022] Elected to serve on the Technical Committee of the Machine Learning for Signal Processing (MLSP TC) under the IEEE Signal Processing Society.
[Sep 2022] Four papers accetped to NeurIPS 2022.
[August 2022] Our group joined the Department of Computer Science and Engineering at The Ohio State University.
[May 2022] On May 26-27, together with Jere's group, we had our annual Deep & Sparse Team meeting at the University of Denver to discuss project accomplishments and plans.
[May 2022] Gave a 10-hours short course (with Sam Buchanan, Yi Ma, Qing Qu, John Wright, and Yuqian Zhang) on ‘‘Low-Dimensional Models for High-Dimensional Data: From Linear to Nonlinear, Convex to Nonconvex, and Shallow to Deep" at IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).
[May 2021] Invited to serve as a TPC member (area chair) at NeurIPS 2022.
[Dec 2021] Invited to serve as Action Editor at the Transactions on Machine Learning Research.
[Nov 2021] Co-organizing the 2nd workshop on ‘‘Seeking Low-dimensionality in Deep Neural Networks (SLowDNN)’’, Nov. 22nd – Nov. 23rd, 2021.
[Oct 2021] Four papers accetped to NeurIPS 2021.
[May 2021] One ICML’21 on robust subspace learned accepted. New paper released on understanding the behabior of the classifiers in monder deep neural networks.
[May 2021] Our collaborative proposal (with Mike and Gongguo at CSM) on Structured Inference and Adaptive Measurement Design has been awarded by NSF!
[March 2021] Invited to serve as a TPC member (area chair) at NeurIPS 2021.
[March 2021] Invited talk at Microsoft. One paper on Convolutional Normalization is on arxiv. One CVPR’21 on frame interpolation and one AISTATS’21 on hyperplane clustering accepted.
[Nov 2020] Co-organizing IEEE workshop on ‘‘Seeking Low-dimensionality in Deep Neural Networks (SLowDNN)’’, Nov. 23rd – Nov. 24th, 2020.
[Sep 2020] Our paper has been accepted at NeurIPS as spotlight (top 4%), which characterizes implicit bias with discrepant learning rates and builds connections between over-parameterization, RPCA, and deep neural networks.
[Jun 2020] Our proposal (with Jere at JHU) ‘‘Collaborative Research: CIF: Small: Deep Sparse Models: Analysis and Algorithms’’ has been awarded by NSF!
[Jun 2020] Two papers about over-parameterization are on arXiv: one studies the benefit of over-realized model in dictionary learning, another one characterizes implicit bias with discrepant learning rates and builds connection between over-parameterization, RPCA, and deep neural networks.
[Feb 2020] Our paper on robust homography estimation has been accepted to CVPR 2020.
[Jan 2020] Co-organized with Qing and Shuyang, our two-session mini-symposium ‘‘Recent Advances in Optimization Methods for Signal Processing and Machine Learning’’ has been accepted by the inaugural SIAM Conference on Mathematics of Data Science. See you at Cincinnati, Ohio in May!
[Jan 2020] Our review paper (with Qing, Xiao, Manolis, John, and Rene) ‘‘Finding the Sparsest Vectors in a Subspace: Theory, Algorithms, and Applications’’ is on arxiv.
[Jan 2020] Invited talk at Statistics, Optimization and Machine Learning Seminar, University of Colorado Boulder.
[Jan 2020] Invited talk at Colorado School of Mines.
[Dec 2019 ] Our paper Nonconvex Robust Low-rank Matrix Recovery has been accepted by SIAM Journal on Optimization.
[Dec 2019 ] Our paper Analysis of the Optimization Landscapes for Overcomplete Representation Learning was accepted to ICLR 2020 and was selected for oral presentation. In this paper, we showed benign optimization landscapes for learning overcomplete/convolutional dictionaries, ensuring simple gradient descent find the targeted solutions.
[Dec 2019 ] Attended NeurIPS 2019 and presented 3 papers.
[Dec 2019] Invited talk at Signal and Information Processing Seminar, Rutgers University.
[Nov 2019] Our paper (with Xiao, Shixiang, Zengde, Qing, and Anthony) ‘‘Nonsmooth Optimization over Stiefel Manifold: Riemannian Subgradient Methods’’ is on arxiv. This work provides (first) explicit convergence rate guarantees for a family of Riemannian subgradient methods when used to optimize nonsmooth functions (that are weakly convex in the Euclidean space) over then Stiefel manifold.
[Oct 2019] Attended the Northrop Grumman University Research Symposium, and presented our work on ‘‘Object Identification with Less Supervision".
[Oct 2019] Attended the Computational Imaging workshop at IMA, University of Minnesota, and presented our work on ‘‘A Linearly Convergent Method for Non-smooth Non-convex Optimization on Grassmannian with Applications to Robust Subspace and Dictionary Learning’’.
[Sep 2019] Gave an invited talk on Provable Nonconvex Approaches for Low-rank Models at Workshop on Low-Rank Models and Applications (LRMA), University of Mons, Belgium, Sep 12 – 13, 2019.
[Sep 2019] 3 papers accepted to NeurIPS 2019.
[Aug 2019] Gave an invited talk at ICCOPT 2019, the Sixth International Conference on Continuous Optimization, Technical University (TU) of Berlin, Aug 3 – 8, 2019.
[Aug 2019] Our paper (with Xiao, Anthony, Jason) ‘‘Incremental Methods for Weakly Convex Optimization’’ is on arxiv. This work provides (first) convergence guarantee for incrememtal algorithms and their random shuffling version (including the incremental subgradient method which is the work-horse of deep learning) in solving weakly convex optimization problems which could be nonconvex and nonsmooth.
[Aug 2019] Our paper (with Qing, Xiao) ‘‘A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution’’ is on arxiv. This work considers multichannel sparse blind deconvolution problem and provides efficient first-order methods that can exactly solve this blind deconvolution problem in a linear rate.