← Back to all news
arXiv Machine Learning By Corinna Cortes, Yishay Mansour, Mehryar Mohri

Beyond Binary: Continuous State Optimization with Graph-Structured Objectives

Read the original on arXiv Machine Learning →

arXiv:2608. 09366v1 Announce Type: new Abstract: Large-scale learning systems often face the challenge of balancing multiple, potentially competing objectives, such as fairness, accuracy, and latency.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Related stories

arXiv Machine Learning
Jul 8

GraphAllocBench: A Flexible Benchmark for Preference-Conditioned Multi-Objective Policy Learning

arXiv:2601. 20753v4 Announce Type: replace Abstract: Preference-Conditioned Policy Learning (PCPL) in Multi-Objective Reinforcement Learning (MORL) approximates diverse Pareto-optimal solutions by conditioning a single policy on user-specified preferences, enabling run-time adaptation to arbitrary trade-offs without retraining.

By Zhiheng Jiang, Yunzhe Wang, Ryan Marr, Ellen Novoseller, Benjamin T. Files, Volkan Ustun
reinforcement-learningbenchmarks
More like this →
arXiv Machine Learning
Sep 10

Feedback Control for Multi-Objective Graph Self-Supervision

The paper introduces ControlG, a control‑theoretic framework for coordinating multi‑objective graph self‑supervised learning. It treats objective coordination as a temporal allocation problem, estimating each objective’s difficulty and antagonism, planning budgets with a Pareto‑aware log‑hypervolume planner, and scheduling updates via a PID controller. Experiments on nine datasets show that ControlG consistently outperforms state‑of‑the‑art baselines and provides an auditable schedule revealing which objectives drive learning.

By Karish Grover, Theodore Vasiloudis, Han Xie, Sixing Lu, Xiang Song, Christos Faloutsos
benchmarks
More like this →