Talks¶
Video¶
Maximizing Submodular Functions over the Integer Lattice [PDF(ArXiv)]
with Yuichi Yoshida
HIM Rigidity Workshop, Haussdorff Institute for Mathematics, University of Bonn, 2015
Tutorial¶
A crash course on graph theory
iTHEMS Graph-Theory meeting 2023
Technical talks¶
Spectral Sparsification of Hypergraphs
ISMP 2024 (same as “Online Algorithms for Spectral Hypergraph Sparsification” at IPCO 2024)
Algebraic combinatorial optimization on the degree of determinants of noncommutative symbolic matrices
The 26th Aussois Combinatorial Optimization Workshop 2024
Shrunk subspace via operator Sinkhorn iteration
SODA23, 2023
Information Geometry of Operator Scaling
RIKEN iTHEMS math seminar, 2020
No-regret algorithms for online k-submodular function maximization
UBC algorithm seminar, 2019
A New Approximation Guarantee for Monotone Submodular Function Maximization via Discrete Convexity
The 45th International Colloquium on Automata, Languages, and Programming (ICALP), 2018,
Regret Ratio Minimization in Multi-objective Submodular Function Maximization
The 31st AAAI Conference on Artificial Inteligence, 2017
Non-Convex Compressed Sensing with the Sum-of-Squares Method
ACM-SIAM Symposium on Discrete Algorithms (SODA), 2016,
The low-rank basis problem for a matrix subspace
Internatinal Symposium on Mathematical Programming (ISMP), 2015
Multicasting in Linear Deterministic Relay Network by Matrix Completion
IEEE International Symposium on Information Theory (ISIT), 2014
Optimal Budget Allocation: Theoretical Guarantee and Efficient Algorithm [Video]
International Conference on Machine Learning (ICML), 2014
Fast Deterministic Algorithms for Matrix Completion Problems
Integer Programming and Combinatorial Optimization (IPCO), 2013