Jian Yang

CV
h-index18
3papers
7citations
Novelty53%
AI Score26

3 Papers

1.2GNApr 2, 2017
Game-theoretic Modeling of Players' Ambiguities on External Factors

Jian Yang

We propose a game-theoretic framework that incorporates both incomplete information and general ambiguity attitudes on factors external to all players. Our starting point is players' preferences on payoff-distribution vectors, essentially mappings from states of the world to distributions of payoffs to be received by players. There are two ways in which equilibria for this preference game can be defined. When the preferences possess ever more features, we can gradually add ever more structures to the game. These include real-valued utility-like functions over payoff-distribution vectors, sets of probabilistic priors over states of the world, and eventually the traditional expected-utility framework involving one single prior. We establish equilibrium existence results, show the upper hemi-continuity of equilibrium sets over changing ambiguity attitudes, and uncover relations between the two versions of equilibria. Some attention is paid to the enterprising game, in which players exhibit ambiguity seeking attitudes while betting optimistically on the favorable resolution of ambiguities. The two solution concepts are unified at this game's pure equilibria, whose existence is guaranteed when strategic complementarities are present. The current framework can be applied to settings like auctions involving ambiguity on competitors' assessments of item worths.

6.2CVJan 10, 2025
Beyond Flat Text: Dual Self-inherited Guidance for Visual Text Generation

Minxing Luo, Zixun Xia, Liaojun Chen et al.

In real-world images, slanted or curved texts, especially those on cans, banners, or badges, appear as frequently, if not more so, than flat texts due to artistic design or layout constraints. While high-quality visual text generation has become available with the advanced generative capabilities of diffusion models, these models often produce distorted text and inharmonious text background when given slanted or curved text layouts due to training data limitation. In this paper, we introduce a new training-free framework, STGen, which accurately generates visual texts in challenging scenarios (\eg, slanted or curved text layouts) while harmonizing them with the text background. Our framework decomposes the visual text generation process into two branches: (i) \textbf{Semantic Rectification Branch}, which leverages the ability in generating flat but accurate visual texts of the model to guide the generation of challenging scenarios. The generated latent of flat text is abundant in accurate semantic information related both to the text itself and its background. By incorporating this, we rectify the semantic information of the texts and harmonize the integration of the text with its background in complex layouts. (ii) \textbf{Structure Injection Branch}, which reinforces the visual text structure during inference. We incorporate the latent information of the glyph image, rich in glyph structure, as a new condition to further strengthen the text structure. To enhance image harmony, we also apply an effective combination method to merge the priors, providing a solid foundation for generation. Extensive experiments across a variety of visual text layouts demonstrate that our framework achieves superior accuracy and outstanding quality.

1.5MLOct 22, 2015
Inventory Control Involving Unknown Demand of Discrete Nonperishable Items - Analysis of a Newsvendor-based Policy

Michael N. Katehakis, Jian Yang, Tingting Zhou

Inventory control with unknown demand distribution is considered, with emphasis placed on the case involving discrete nonperishable items. We focus on an adaptive policy which in every period uses, as much as possible, the optimal newsvendor ordering quantity for the empirical distribution learned up to that period. The policy is assessed using the regret criterion, which measures the price paid for ambiguity on demand distribution over $T$ periods. When there are guarantees on the latter's separation from the critical newsvendor parameter $β=b/(h+b)$, a constant upper bound on regret can be found. Without any prior information on the demand distribution, we show that the regret does not grow faster than the rate $T^{1/2+ε}$ for any $ε>0$. In view of a known lower bound, this is almost the best one could hope for. Simulation studies involving this along with other policies are also conducted.