Research map / Learning theory and algorithms / Matrix and tensor methods
Rank Ordering Constraints Elimination with Application for Kernel Learning
Ying Xie, Chris Ding, Yihong Gong, Zongze Wu
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 |
|---|---|---|---|
| replace QCQP with slack variable transform plus multiplicative update algorithm for rank-ordered kernel alignment | ordered constrained kernel alignment (KA1) · pc-mac | computation time (seconds): 12.5 -> 0.125 | Improved |
| replace QCQP with slack transform algorithm | kernel alignment · seven datasets | computation time | Improved |
| add rank ordering constraints on kernel weights (KA1 versus unordered KA0) (ablation) | spectral kernel alignment with SVM and harmonic function · semi-supervised classification, 30 runs | accuracy | Improved |
Closest papers by meaning
- Learning to Rank by Directly Optimizing Full-Order Probabilities (ICML 2026 · similarity 0.85)
- PiRank: Scalable Learning To Rank via Differentiable Sorting (NeurIPS 2021 · similarity 0.84)
- On the Target-kernel Alignment: a Unified Analysis with Kernel Complexity (NeurIPS 2024 · similarity 0.83)
- Learning to Rank Learning Curves (ICML 2020 · similarity 0.83)
- Joker: Joint Optimization Framework for Lightweight Kernel Machines (ICML 2025 · similarity 0.81)
- Scalable Kernel Inverse Optimization (NeurIPS 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.
