Simultaneously Achieving Sublinear Regret and Constraint Violations for Online Convex Optimization with Time-varying Constraints

no code implementations • 15 Nov 2021 • Qingsong Liu, Wenfei Wu, Longbo Huang, Zhixuan Fang

In this paper, we develop a novel virtual-queue-based online algorithm for online convex optimization (OCO) problems with long-term and time-varying constraints and conduct a performance analysis with respect to the dynamic regret and constraint violations.

Domain Adaptation as a Problem of Inference on Graphical Models

1 code implementation • NeurIPS 2020 • Kun Zhang, Mingming Gong, Petar Stojanov, Biwei Huang, Qingsong Liu, Clark Glymour

Such a graphical model distinguishes between constant and varied modules of the distribution and specifies the properties of the changes across domains, which serves as prior knowledge of the changing modules for the purpose of deriving the posterior of the target variable $Y$ in the target domain.

Bayesian Inference Unsupervised Domain Adaptation