Cover Image

When to Screen, When to Bypass: LLM-Judges in Resource-Scarce AI-Human Workflow

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Lin, Ruihan, Zhang, Jiheng
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

When to Match: A Cost-Balancing Principle for Dynamic Markets
by: Liu, Jie, et al.
Published: (2026)

Large-Scale LLM Inference with Heterogeneous Workloads: Prefill-Decode Contention and Asymptotically Optimal Control
by: Lin, Ruihan, et al.
Published: (2026)

Fair and Diverse Allocation of Scarce Resources
by: Anahideh, Hadis, et al.
Published: (2020)

When Should you Offer an Upgrade: Online Upgrading Mechanisms for Resource Allocation
by: Jaillet, Patrick, et al.
Published: (2024)

Best Arm Identification with LLM Judges and Limited Human
by: Ao, Ruicheng, et al.
Published: (2026)

When an Approximate Model Suffices for Optimal Control
by: Malikopoulos, Andreas A.
Published: (2026)

When are Lossy Energy Storage Optimization Models Convex?
by: Taha, Feras Al, et al.
Published: (2024)

OR-R1: Automating Modeling and Solving of Operations Research Optimization Problem via Test-Time Reinforcement Learning
by: Ding, Zezhen, et al.
Published: (2025)

Bounds on Prediction Error When Using an Impulse Response/Equilibrium Model Structure
by: Vincent, Tyrone L., et al.
Published: (2026)

Singular Perturbation: When the Perturbation Parameter Becomes a State-Dependent Function
by: Liu, Tengfei, et al.
Published: (2024)

Weak Optimal Transport: When is the Dual Potential Convex?
by: Pramenković, Filip
Published: (2025)

When Koopman Meets Hamilton and Jacobi
by: Vaidya, Umesh
Published: (2025)

When sampling works in data-driven control: Informativity for stabilization in continuous time
by: Eising, Jaap, et al.
Published: (2023)

Privacy-Preserving Convex Optimization: When Differential Privacy Meets Stochastic Programming
by: Dvorkin, Vladimir, et al.
Published: (2022)

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?
by: Gao, Wenzhi, et al.
Published: (2024)

Learning Optimal and Fair Policies for Online Allocation of Scarce Societal Resources from Data Collected in Deployment
by: Tang, Bill, et al.
Published: (2023)

Acceleration Exists! Optimization Problems When Oracle Can Only Compare Objective Function Values
by: Lobanov, Aleksandr, et al.
Published: (2024)

When to use simulated annealing for solving CVRP? A case study of fuel deliveries in Poland
by: Naumov, Vitalii
Published: (2024)

Phases of Muon: When Muon Eclipses SignSGD
by: Paquette, Elliot, et al.
Published: (2026)

When to Forget? Complexity Trade-offs in Machine Unlearning
by: Van Waerebeke, Martin, et al.
Published: (2025)

MARS-M: When Variance Reduction Meets Matrices
by: Liu, Yifeng, et al.
Published: (2025)

When Nash Meets Stackelberg
by: Carvalho, Margarida, et al.
Published: (2019)

When Deep Learning Meets Polyhedral Theory: A Survey
by: Huchette, Joey, et al.
Published: (2023)

When do spectral gradient updates help in deep learning?
by: Davis, Damek, et al.
Published: (2025)

When is Momentum Extragradient Optimal? A Polynomial-Based Analysis
by: Kim, Junhyung Lyle, et al.
Published: (2022)

Randomization Inference When N Equals One
by: Liang, Tengyuan, et al.
Published: (2023)

When Descent Is Too Stable: Event-Triggered Hamiltonian Learning to Optimize
by: Wang, Yi, et al.
Published: (2026)

Learning When to Restart: Nonstationary Newsvendor from Uncensored to Censored Demand
by: Chen, Xin, et al.
Published: (2025)

Leveraging Continuous Time to Understand Momentum When Training Diagonal Linear Networks
by: Papazov, Hristo, et al.
Published: (2024)

When GNNs meet symmetry in ILPs: an orbit-based feature augmentation approach
by: Chen, Qian, et al.
Published: (2025)

When Location Shapes Choice: Placement Optimization of Substitutable Products
by: Housni, Omar El, et al.
Published: (2023)

Welfare and Cost Aggregation for Multi-Agent Control: When to Choose Which Social Cost Function, and Why?
by: Shilov, Ilia, et al.
Published: (2025)

Efficient Unit Commitment Constraint Screening under Uncertainty
by: He, Xuan, et al.
Published: (2024)

Operating Imperfect AI: Reliability Drift and Human Congestion
by: Wang, Ziyao, et al.
Published: (2026)

On the Width Scaling of Neural Optimizers Under Matrix Operator Norms I: Row/Column Normalization and Hyperparameter Transfer
by: Xu, Ruihan, et al.
Published: (2026)

Too Sharp, Too Sure: When Calibration Follows Curvature
by: Morosini, Alessandro, et al.
Published: (2026)

Screening Cut Generation for Sparse Ridge Regression
by: Tan, Haozhe, et al.
Published: (2025)

When does learning pay off? A study on DRL-based dynamic algorithm configuration for carbon-aware scheduling
by: Mencaroni, Andrea, et al.
Published: (2026)

When majority rules, minority loses: bias amplification of gradient descent
by: Bachoc, François, et al.
Published: (2025)

A Framework for the Bayesian Calibration of Complex and Data-Scarce Models in Applied Sciences
by: Schenk, Christina, et al.
Published: (2026)