Pith. sign in

REVIEW 4 cited by

Smooth Tchebycheff Scalarization for Multi-Objective Optimization

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2402.19078 v3 pith:HPR3TZQ6 submitted 2024-02-29 cs.LG cs.AIcs.NEmath.OC

classification cs.LGcs.AIcs.NEmath.OC
keywords optimizationmulti-objectivemethodssmoothcomplexitycomputationalgoodobjectives
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Multi-objective optimization problems can be found in many real-world applications, where the objectives often conflict each other and cannot be optimized by a single solution. In the past few decades, numerous methods have been proposed to find Pareto solutions that represent optimal trade-offs among the objectives for a given problem. However, these existing methods could have high computational complexity or may not have good theoretical properties for solving a general differentiable multi-objective optimization problem. In this work, by leveraging the smooth optimization technique, we propose a lightweight and efficient smooth Tchebycheff scalarization approach for gradient-based multi-objective optimization. It has good theoretical properties for finding all Pareto solutions with valid trade-off preferences, while enjoying significantly lower computational complexity compared to other methods. Experimental results on various real-world application problems fully demonstrate the effectiveness of our proposed method.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. MOSAIC: Adaptive Inter-layer Composition for Efficient Heterogeneous Vision-Language Models

    cs.CV 2026-07 accept novelty 6.0 of 10

    MOSAIC uses multi-objective MIP search over linear/sparse/low-rank operators plus two-stage distillation to convert a homogeneous VLM into a hardware-aware heterogeneous model that matches teacher performance at 2.5× ...

  2. AutoScale: Linear Scalarization Guided by Multi-Task Optimization Metrics

    cs.LG 2025-08 conditional novelty 6.0 of 10

    AutoScale selects fixed linear-scalarization weights by optimizing multi-task optimization metrics during a short exploration phase, matching grid-searched performance without search.

  3. FastCAR: Fast Classification And Regression for Task Consolidation in Multi-Task Learning to Model a Continuous Property Variable of Detected Object Class

    cs.CV 2025-05 conditional novelty 6.0 of 10

    A single regression network trained on class-shifted hardness labels can jointly classify steel microstructures and predict hardness, outperforming multi-task baselines on the authors' own dataset.

  4. EndoARSS: Adapting Spatially-Aware Foundation Model for Efficient Activity Recognition and Semantic Segmentation in Endoscopic Surgery

    cs.CV 2025-06 conditional novelty 4.0 of 10

    A DINOv2-based multi-task framework with task-specific low-rank adapters and a spatial attention module reports state-of-the-art joint activity recognition and semantic segmentation on three endoscopic surgery datasets.

Pith tools