Research map / Label-efficient and robust learning / Domain adaptation and generalization
Order Learning Using Partially Ordered Data via Chainization
Seon-Ho Lee, Chang-Su Kim
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 |
|---|---|---|---|
| fine-tune comparator on chainization pseudo pairs (vs OL) | order learning comparator · Adience, gamma=0.005% | accuracy: 31.8% -> 56.7% | Improved |
| fine-tune comparator on chainization pseudo pairs (vs OL) | order learning comparator · MORPH II linear extension, gamma=0.05% | Spearman rho: 0.897 -> 0.918 | Improved |
| fine-tune comparator on chainization pseudo pairs (vs OL) | order learning comparator · Adience linear extension, gamma=0.01% | Spearman rho: 0.809 -> 0.908 | Improved |
| fine-tune comparator on chainization pseudo pairs (vs OL) | order learning comparator · Aesthetics linear extension, gamma=0.01% | Spearman rho: 0.665 -> 0.838 | Improved |
| estimate missing orderings with comparator (vs Kahn topological sort) | Kahn's algorithm · MORPH II linear extension, gamma=0.05% | Spearman rho: 0.205 -> 0.918 | Improved |
| apply chainization with partial supervision (gamma=0.03%) vs full supervision | order learning on Adience · Adience | accuracy: 61.7 -> 59.7 | Hurt |
| use chainization at gamma=0.08% vs POE | POE · Adience | accuracy: 60.5 -> 60.5 | No clear effect |
| add chainization to OL for domain adaptation | OL · Adience to MORPH II | accuracy: 43.8 -> 51.5 | Improved |
| add chainization to OL for domain adaptation | OL · Adience to MORPH II | Spearman rho: 0.630 -> 0.798 | Improved |
| use chainization in bipartite case vs OL | OL · MORPH II bipartite | MAE: 8.696 -> 5.903 | Improved |
| use chainization in bipartite case vs OL | OL · Adience bipartite | MAE: 1.682 -> 0.807 | Improved |
| use chainization in bipartite case vs OL | OL · MORPH II bipartite | Spearman rho: 0.068 -> 0.638 | Improved |
Closest papers by meaning
- Stochastic Order Learning: An Approach to Rank Estimation Using Noisy Data (ICML 2026 · similarity 0.86)
- Active Seriation: Efficient Ordering Recovery with Statistical Guarantees (NeurIPS 2025 · similarity 0.85)
- Learning to Rank by Directly Optimizing Full-Order Probabilities (ICML 2026 · similarity 0.85)
- Are Greedy Task Orderings Better Than Random in Continual Linear Regression? (NeurIPS 2025 · similarity 0.84)
- Active preference learning for ordering items in- and out-of-sample (NeurIPS 2024 · similarity 0.83)
- Partial Optimality in the Linear Ordering Problem (ICML 2024 · similarity 0.82)
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.
