Pages that link to "Item:Q5144778"

The following pages link to Fast Best Subset Selection: Coordinate Descent and Local Combinatorial Optimization Algorithms (Q5144778):

Displaying 35 items.

• L0Learn (Q52543) (← links)
• Best subset selection via a modern optimization lens (Q282479) (← links)
• An extended Newton-type algorithm for \(\ell_2\)-regularized sparse logistic regression and its efficiency for classifying large-scale datasets (Q2033090) (← links)
• Sparse classification: a scalable discrete optimization perspective (Q2071494) (← links)
• Robust subset selection (Q2076115) (← links)
• Mining events with declassified diplomatic documents (Q2078743) (← links)
• Sparse regression at scale: branch-and-bound rooted in first-order optimization (Q2097642) (← links)
• The backbone method for ultra-high dimensional sparse machine learning (Q2163249) (← links)
• Rejoinder: ``Best subset, forward stepwise or Lasso? Analysis and recommendations based on extensive comparisons'' (Q2225320) (← links)
• Linear regression with partially mismatched data: local search with theoretical guarantees (Q2689832) (← links)
• On the Optimality of the Backward Greedy Algorithm for the Subset Selection Problem (Q4943659) (← links)
• Randomized Gradient Boosting Machine (Q4971024) (← links)
• (Q4998944) (← links)
• On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables (Q5041763) (← links)
• An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems (Q5060779) (← links)
• MIP-BOOST: Efficient and Effective <i>L</i>₀ Feature Selection for Linear Regression (Q5066443) (← links)
• A polynomial algorithm for best-subset selection problem (Q5073242) (← links)
• Subset selection in network-linked data (Q5086104) (← links)
• (Q5159402) (← links)
• The Trimmed Lasso: Sparse Recovery Guarantees and Practical Optimization by the Generalized Soft-Min Penalty (Q5162621) (← links)
• Grouped variable selection with discrete optimization: computational and statistical perspectives (Q6046300) (← links)
• HARFE: hard-ridge random feature expansion (Q6049834) (← links)
• Sparse quantile regression (Q6108347) (← links)
• On clustering and interpreting with rules by means of mathematical optimization (Q6109555) (← links)
• Comparing solution paths of sparse quadratic minimization with a Stieltjes matrix (Q6120849) (← links)
• Subset Selection and the Cone of Factor-Width-<i>k</i> Matrices (Q6195312) (← links)
• Variable selection in additive models via hierarchical sparse penalty (Q6490395) (← links)
• COMBSS: best subset selection via continuous optimization (Q6494417) (← links)
• Penalty method for the sparse portfolio optimization problem (Q6574067) (← links)
• SRMD: sparse random mode decomposition (Q6575285) (← links)
• Cardinality minimization, constraints, and regularization: a survey (Q6585278) (← links)
• Exterior-point optimization for sparse and low-rank optimization (Q6608755) (← links)
• A neutral comparison of algorithms to minimize \(L_0\) penalties for high-dimensional variable selection (Q6625366) (← links)
• PolyCD: optimization via cycling through the vertices of a polytope (Q6633143) (← links)
• Constrained optimization of rank-one functions with indicator variables (Q6634534) (← links)