The paper establishes equilibrium existence and uniqueness for nonlinear utility consumer networks under contraction conditions and proposes a shape-constrained isotonic regression approach with strict no-regret convergence for learning utilities in targeted monopoly pricing.
International conference on machine learning , pages=
6 Pith papers cite this work. Polarity classification is still indexing.
6
Pith papers citing it
years
2026 6verdicts
UNVERDICTED 6representative citing papers
A modular reduction from budget-constrained contextual bandits with adversarial contexts to unconstrained bandits via surrogate rewards, yielding improved guarantees and an efficient algorithm based on SquareCB.
Adapts bandit algorithms to the Cox PH survival model for online treatment optimization under censoring, with theoretical sublinear regret and validation on simulations plus SEER cancer data.
CCBO enables collaborative contextual Bayesian optimization across clients with sublinear regret guarantees and shows substantial gains over non-collaborative methods in simulations and a hot rolling application even under heterogeneity.
A projection-based algorithm for COCO achieves O(log T) regret and O(log T) CCV for strongly convex losses and O(sqrt(T)) for convex losses by leveraging self-contracted curves.
Matrix-weighted regularization for robust multi-task regression achieves optimal MSE under weaker spectral assumptions and performs no worse than independent learning when balancedness is poor.
citing papers explorer
-
Equilibrium and Pricing in Consumer Networks with Nonlinear Utilities: An Online Shape-Constrained Learning Approach
The paper establishes equilibrium existence and uniqueness for nonlinear utility consumer networks under contraction conditions and proposes a shape-constrained isotonic regression approach with strict no-regret convergence for learning utilities in targeted monopoly pricing.
-
Constrained Contextual Bandits with Adversarial Contexts
A modular reduction from budget-constrained contextual bandits with adversarial contexts to unconstrained bandits via surrogate rewards, yielding improved guarantees and an efficient algorithm based on SquareCB.
-
Online Survival Analysis: A Bandit Approach under Cox PH Model
Adapts bandit algorithms to the Cox PH survival model for online treatment optimization under censoring, with theoretical sublinear regret and validation on simulations plus SEER cancer data.
-
Collaborative Contextual Bayesian Optimization
CCBO enables collaborative contextual Bayesian optimization across clients with sublinear regret guarantees and shows substantial gains over non-collaborative methods in simulations and a hot rolling application even under heterogeneity.
-
Improved Guarantees for Constrained Online Convex Optimization via Self-Contraction
A projection-based algorithm for COCO achieves O(log T) regret and O(log T) CCV for strongly convex losses and O(sqrt(T)) for convex losses by leveraging self-contracted curves.
-
Multi-task Linear Regression without Eigenvalue Lower Bounds: Adaptivity, Robustness, and Safety
Matrix-weighted regularization for robust multi-task regression achieves optimal MSE under weaker spectral assumptions and performs no worse than independent learning when balancedness is poor.