The following pages link to Rahul Mazumder (Q282478):
Displayed 40 items.
- Matrix Completion and Low-Rank SVD via Fast Alternating Least Squares (Q97013) (← links)
- Best subset selection via a modern optimization lens (Q282479) (← links)
- (Q482901) (redirect page) (← links)
- Least quantile regression via modern optimization (Q482902) (← links)
- Modeling item-item similarities for personalized recommendations on Yahoo! front page (Q652346) (← links)
- A new perspective on boosting in linear regression via subgradient optimization and relatives (Q682283) (← links)
- Flexible low-rank statistical modeling with missing data and side information (Q1799348) (← links)
- The graphical lasso: new insights and alternatives (Q1950894) (← links)
- Linear regression with mismatched data: a provably optimal local search algorithm (Q2061907) (← links)
- Mining events with declassified diplomatic documents (Q2078743) (← links)
- Sparse regression at scale: branch-and-bound rooted in first-order optimization (Q2097642) (← links)
- Computing the degrees of freedom of rank-regularized estimators and cousins (Q2180064) (← links)
- Matrix completion with nonconvex regularization: spectral operators and scalable algorithms (Q2195855) (← links)
- Discussion of ``Best subset, forward stepwise or Lasso? Analysis and recommendations based on extensive comparisons'' (Q2225316) (← links)
- Computation of the maximum likelihood estimator in low-rank factor analysis (Q2425172) (← links)
- Linear regression with partially mismatched data: local search with theoretical guarantees (Q2689832) (← links)
- (Q2896145) (← links)
- An Extended Frank--Wolfe Method with “In-Face” Directions, and Its Application to Low-Rank Matrix Completion (Q2968175) (← links)
- <i>SparseNet</i>: Coordinate Descent With Nonconvex Penalties (Q3111203) (← links)
- Fluid flow pattern analysis in a trough region: a nonparametric approach (Q3532698) (← links)
- Randomized Gradient Boosting Machine (Q4971024) (← links)
- Frank--Wolfe Methods with an Unbounded Feasible Region and Applications to Structured Learning (Q5055686) (← links)
- Using ℓ1-Relaxation and Integer Programming to Obtain Dual Bounds for Sparse PCA (Q5095184) (← links)
- Fast Best Subset Selection: Coordinate Descent and Local Combinatorial Optimization Algorithms (Q5144778) (← links)
- (Q5159402) (← links)
- Assessing the significance of global and local correlations under spatial autocorrelation: A nonparametric approach (Q5170212) (← links)
- A Computational Framework for Multivariate Convex Regression and Its Variants (Q5229914) (← links)
- The Discrete Dantzig Selector: Estimating Sparse Linear Models via Mixed Integer Linear Optimization (Q5347971) (← links)
- Certifiably Optimal Low Rank Factor Analysis (Q5361290) (← links)
- (Q5405145) (← links)
- Grouped variable selection with discrete optimization: computational and statistical perspectives (Q6046300) (← links)
- Integration of survival data from multiple studies (Q6055679) (← links)
- Subset Selection with Shrinkage: Sparse Linear Modeling When the SNR Is Low (Q6202664) (← links)
- Sparse principal component analysis and its $l_1$-relaxation (Q6294753) (← links)
- Learning Sparse Classifiers: Continuous and Mixed Integer Optimization Perspectives (Q6333079) (← links)
- Frank-Wolfe Methods with an Unbounded Feasible Region and Applications to Structured Learning (Q6357250) (← links)
- Linear regression with partially mismatched data: local search with theoretical guarantees (Q6369411) (← links)
- A Light-speed Linear Program Solver for Personalized Recommendation with Diversity Constraints (Q6418144) (← links)
- A Cyclic Coordinate Descent Method for Convex Optimization on Polytopes (Q6429463) (← links)
- Linear programming using diagonal linear networks (Q6453716) (← links)