Research map / Learning theory and algorithms / Combinatorial and search optimization
On The Projection Operator to A Three-view Cardinality Constrained Set
Haichuan Yang, Shupeng Gui, Chuyang Ke, Daniel Stefankovic, Ryohei Fujimaki, Ji Liu
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use the TVCS-constrained method instead of MINET | Gene regulatory network identification · Gene regulatory network simulation | AUC: 0.5910$\pm$0.0458 -> 0.7136$\pm$0.0306 | Improved |
| Use the TVCS-constrained method instead of ARACNE | Gene regulatory network identification · Gene regulatory network simulation | SP: 0.9127$\pm$0.0579 -> 0.7397$\pm$0.0319 | Hurt |
| Use the TVCS-constrained method instead of MINET | Gene regulatory network identification · Gene regulatory network simulation | SN: 0.5764$\pm$0.0425 -> 0.6875$\pm$0.0295 | Improved |
| Use the TVCS-constrained method instead of MINET | Gene regulatory network identification · Gene regulatory network simulation | ACC: 0.5585$\pm$0.0458 -> 0.7119$\pm$0.0305 | Improved |
| Use the TVCS-constrained method instead of MINET | Gene regulatory network identification · Gene regulatory network simulation | F-measure: 0.5547$\pm$0.0425 -> 0.7126$\pm$0.0306 | Improved |
| Use the TVCS-constrained method instead of GENIE3 | Gene regulatory network identification · Gene regulatory network simulation | MCC: 0.0595$\pm$0.0547 -> 0.4264$\pm$0.0611 | Improved |
| Use TVCS-constrained assignment optimization instead of random assignment | Crowdsourcing task assignment · Synthetic crowdsourcing data | expected accuracy | Improved |
| Include overall, row-wise, and column-wise sparsity constraints | Synthetic linear regression and classification · Synthetic data | selection recall | Improved |
Closest papers by meaning
- Fast Projection onto the Capped Simplex with Applications to Sparse Regression in Bioinformatics (NeurIPS 2021 · similarity 0.83)
- Cardinality-Aware Set Prediction and Top-$k$ Classification (NeurIPS 2024 · similarity 0.83)
- Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees (ICML 2025 · similarity 0.82)
- Geometric Algorithms for Neural Combinatorial Optimization with Constraints (NeurIPS 2025 · similarity 0.82)
- Generalization Bound and Learning Methods for Data-Driven Projections in Linear Programming (NeurIPS 2024 · similarity 0.81)
- CEGAR-Based Approach for Solving Combinatorial Optimization Modulo Quantified Linear Arithmetics Problems (AAAI 2024 · similarity 0.81)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
