Industry
CONSOLE: Convex Neural Symbolic Learning
Learning the underlying equation from data is a fundamental problem in many disciplines. Recent advances rely on Neural Networks (NNs) but do not provide theoretical guarantees in obtaining the exact equations owing to the non-convexity of NNs. In this paper, we propose Convex Neural Symbolic Learning (CONSOLE) to seek convexity under mild conditions. The main idea is to decompose the recovering process into two steps and convexify each step.
Localization, Convexity, and Star Aggregation
Offset Rademacher complexities have been shown to provide tight upper bounds for the square loss in a broad class of problems including improper statistical learning and online learning. We show that the offset complexity can be generalized to any loss that satisfies a certain general convexity condition. Further, we show that this condition is closely related to both exponential concavity and self-concordance, unifying apparently disparate results. By a novel geometric argument, many of our bounds translate to improper learning in a non-convex class with Audibert's star algorithm. Thus, the offset complexity provides a versatile analytic tool that covers both convex empirical risk minimization and improper learning under entropy conditions. Applying the method, we recover the optimal rates for proper and improper learning with the p-loss for 1
S-Prompts Learning with Pre-trained Transformers: An Occam's Razor for Domain Incremental Learning
State-of-the-art deep neural networks are still struggling to address the catastrophic forgetting problem in continual learning. In this paper, we propose one simple paradigm (named as S-Prompting) and two concrete approaches to highly reduce the forgetting degree in one of the most typical continual learning scenarios, i.e., domain increment learning (DIL). The key idea of the paradigm is to learn prompts independently across domains with pre-trained transformers, avoiding the use of exemplars that commonly appear in conventional methods. This results in a win-win game where the prompting can achieve the best for each domain.
Japan to protect celebrity voices against AI use
A Justice Ministry panel discusses how the voices of individuals should be protected under publicity and portrait rights, amid a rise in the unauthorized use of celebrities' voices by generative artificial intelligence, at the ministry in Tokyo on Friday. An expert panel under the Justice Ministry has agreed that the voices of individuals should be protected under publicity and portrait rights, amid a rise in the unauthorized use of celebrities' voices by generative artificial intelligence. The agreement was made Friday, during the first meeting of the panel on civil compensation claims related to the unauthorized use of celebrities' images and voices by generative AI. The ministry is set to compile guidelines on the scope and standards for illegal acts under current law by this summer. In a time of both misinformation and too much information, quality journalism is more crucial than ever.