We lifted 5 functions out of this paper's own repositories and ran 4 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| lihenryhfl/projection_stg | canonical | 4 of 5 |
| Function | Status | Where it lives |
|---|---|---|
| omp | Ran | lihenryhfl/projection_stg/utils.py code served (permissive licence) · get_code("55742b838876dad6") |
| omp_orig | Ran | lihenryhfl/projection_stg/utils.py code served (permissive licence) · get_code("479a39a621c2edba") |
| regress | Ran | lihenryhfl/projection_stg/projection_stg.py code served (permissive licence) · get_code("492f138ef22a87f7") |
| sample_z | Ran | lihenryhfl/projection_stg/projection_stg.py code served (permissive licence) · get_code("f61147a4238c2354") |
| regress_mu | Not yet run | lihenryhfl/projection_stg/projection_stg.py code served (permissive licence) · get_code("3ba9ea612187dc98") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Consider the problem of simultaneous estimation and support recovery of the coefficient vector in a linear data model with additive Gaussian noise. We study the problem of estimating the model coefficients based on a recently proposed non-convex regularizer, namely the stochastic gates (STG) [Yamada et al. 2020]. We suggest a new projection-based algorithm for solving the STG regularized minimization problem, and prove convergence and support recovery guarantees of the STG-estimator for a range of random and non-random design matrix setups. Our new algorithm has been shown to outperform the existing STG algorithm and other classical estimators for support recovery in various real and synthetic data analyses.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2110.15960")
get_code_for_paper("2110.15960")
have("2110.15960")
Connect an agent — have() is free.