Wee Chaimanowong

Wee Chaimanowong

The use of Generative AI (GenAI) for creative content generation has gained popularity in recent years. GenAI allows creators to generate contents that are increasingly becoming indistinguishable to the human--generated counter--part at a much lower cost. While GenAI reshapes the competitive landscape of the contents market, the original creators were typically not compensated for their works that were used in the GenAI training. On the other hands, the wide--spread adoption of GenAI threatens to replace the human--generated shares of contents on content platforms, contaminating training data source for future GenAI models. In this paper, we argue that an unregulated usage of GenAI can also be harmful to the platform by causing a contents distribution distortion which can lower the consumers' engagement and the platform's profit. We show that a simple economically--driven creator compensation scheme, can incentivize more creation of high--value human--generated contents, without the need for an AI--detector. This reduces the data pollution for future GenAI training, while improves the consumer engagement and the platform's profit.

Wee Chaimanowong, Ying Zhu

Many machine learning models leverage group invariance which is enjoyed with a wide-range of applications. For exploiting an invariance structure, one common approach is known as \emph{frame averaging}. One popular example of frame averaging is the \emph{group averaging}, where the entire group is used to symmetrize a function. Another example is the \emph{canonicalization}, where a frame at each point consists of a single group element which transforms the point to its orbit representative, for example, sorting. Compared to group averaging, canonicalization is more efficient computationally. However, it results in non-differentiablity or discontinuity of the canonicalized function. As a result, the theoretical performance of canonicalization has not been given much attention. In this work, we establish an approximation theory for canonicalization. Specifically, we bound the point-wise and $L^2(\mathbb{P})$ approximation errors as well as the eigenvalue decay rates associated with a canonicalization trick applied to reproducing kernels. We discuss two key insights from our theoretical analyses and why they point to an interesting future research direction on how one can choose a design to fully leverage canonicalization in practice.