The following pages link to Garvesh Raskutti (Q355079):
Displaying 29 items.
- Geometry of the faithfulness assumption in causal inference (Q355081) (← links)
- Image inpainting using reproducing kernel Hilbert space and Heaviside functions (Q730583) (← links)
- High-dimensional covariance estimation by minimizing \(\ell _{1}\)-penalized log-determinant divergence (Q1952214) (← links)
- Convergence guarantee for the sparse monotone single index model (Q2168091) (← links)
- Testing for high-dimensional network parameters in auto-regressive models (Q2283570) (← links)
- The bias of isotonic regression (Q2293726) (← links)
- Convex regularization for high-dimensional multiresponse tensor regression (Q2414097) (← links)
- (Q2896143) (← links)
- (Q2933989) (← links)
- (Q2953637) (← links)
- Minimax Optimal Rates for Poisson Inverse Problems With Physical Constraints (Q2977355) (← links)
- PUlasso: High-Dimensional Variable Selection With Presence-Only Data (Q3304856) (← links)
- The Frugal Inference of Causal Relations (Q4555053) (← links)
- (Q4558563) (← links)
- Non-Parametric Sparse Additive Auto-Regressive Network Models (Q4629910) (← links)
- (Q4633013) (← links)
- Minimax Optimal Convex Methods for Poisson Inverse Problems Under <inline-formula> <tex-math notation="LaTeX">$\ell_{q}$ </tex-math> </inline-formula>-Ball Sparsity (Q4682857) (← links)
- ISLET: Fast and Optimal Low-Rank Tensor Regression via Importance Sketching (Q5027035) (← links)
- Graph-Based Regularization for Regression Problems with Alignment and Highly Correlated Designs (Q5027037) (← links)
- (Q5053217) (← links)
- (Q5148952) (← links)
- (Q5159466) (← links)
- Learning High-Dimensional Generalized Linear Autoregressive Models (Q5223939) (← links)
- Network Estimation From Point Process Data (Q5223980) (← links)
- Minimax Rates of Estimation for High-Dimensional Linear Regression Over $\ell_q$-Balls (Q5272318) (← links)
- Minimax-optimal rates for sparse additive models over kernel classes via convex programming (Q5405123) (← links)
- The Information Geometry of Mirror Descent (Q5890657) (← links)
- The Information Geometry of Mirror Descent (Q5892400) (← links)
- Learning directed acyclic graphs based on sparsest permutations (Q6243035) (← links)