The following pages link to Tianbao Yang (Q285936):
Displaying 21 items.
- On data preconditioning for regularized loss minimization (Q285940) (← links)
- Detecting communities and their evolutions in dynamic social networks -- a Bayesian approach (Q413825) (← links)
- High-dimensional model recovery from random sketched data by exploring intrinsic sparsity (Q782446) (← links)
- Hybrid safe-strong rules for efficient optimization in Lasso-type problems (Q830584) (← links)
- Online multiple kernel classification (Q1945032) (← links)
- Regret bounded by gradual variation for online convex optimization (Q2251474) (← links)
- An efficient primal dual prox method for non-smooth optimization (Q2339936) (← links)
- A simple homotopy proximal mapping algorithm for compressive sensing (Q2425244) (← links)
- Sparse Learning for Large-Scale and High-Dimensional Data: A Randomized Convex-Concave Optimization Approach (Q2830269) (← links)
- Random Projections for Classification: A Recovery Approach (Q2983374) (← links)
- RSG: Beating Subgradient Method without Smoothness and Strong Convexity (Q4558142) (← links)
- (Q4637046) (← links)
- Online Multiple Kernel Learning: Algorithms and Mistake Bounds (Q4930713) (← links)
- (Q4969260) (← links)
- Weakly-convex–concave min–max optimization: provable algorithms and applications in machine learning (Q5043854) (← links)
- (Q5159451) (← links)
- (Q5214181) (← links)
- Accelerate stochastic subgradient method by leveraging local growth condition (Q5236746) (← links)
- Improved Bounds for the Nyström Method With Application to Kernel Classification (Q5346336) (← links)
- (Q5405197) (← links)
- A Note on Complexity for Two Classes of Structured Non-Smooth Non-Convex Compositional Optimization (Q6754518) (← links)
