training effort
PoLO: Proof-of-Learning and Proof-of-Ownership at Once with Chained Watermarking
Deng, Haiyu, Jiang, Yanna, Yu, Guangsheng, Wang, Qin, Wang, Xu, Ma, Baihe, Ni, Wei, Liu, Ren Ping
Machine learning models are increasingly shared and outsourced, raising requirements of verifying training effort (Proof-of-Learning, PoL) to ensure claimed performance and establishing ownership (Proof-of-Ownership, PoO) for transactions. When models are trained by untrusted parties, PoL and PoO must be enforced together to enable protection, attribution, and compensation. However, existing studies typically address them separately, which not only weakens protection against forgery and privacy breaches but also leads to high verification overhead. We propose PoLO, a unified framework that simultaneously achieves PoL and PoO using chained watermarks. PoLO splits the training process into fine-grained training shards and embeds a dedicated watermark in each shard. Each watermark is generated using the hash of the preceding shard, certifying the training process of the preceding shard. The chained structure makes it computationally difficult to forge any individual part of the whole training process. The complete set of watermarks serves as the PoL, while the final watermark provides the PoO. PoLO offers more efficient and privacy-preserving verification compared to the vanilla PoL solutions that rely on gradient-based trajectory tracing and inadvertently expose training data during verification, while maintaining the same level of ownership assurance of watermark-based PoO schemes. Our evaluation shows that PoLO achieves 99% watermark detection accuracy for ownership verification, while preserving data privacy and cutting verification costs to just 1.5-10% of traditional methods. Forging PoLO demands 1.1-4x more resources than honest proof generation, with the original proof retaining over 90% detection accuracy even after attacks.
A Potential Game Perspective in Federated Learning
Liu, Kang, Wang, Ziqi, Zuazua, Enrique
Federated learning (FL) is an emerging paradigm for training machine learning models across distributed clients. Traditionally, in FL settings, a central server assigns training efforts (or strategies) to clients. However, from a market-oriented perspective, clients may independently choose their training efforts based on rational self-interest. To explore this, we propose a potential game framework where each client's payoff is determined by their individual efforts and the rewards provided by the server. The rewards are influenced by the collective efforts of all clients and can be modulated through a reward factor. Our study begins by establishing the existence of Nash equilibria (NEs), followed by an investigation of uniqueness in homogeneous settings. We demonstrate a significant improvement in clients' training efforts at a critical reward factor, identifying it as the optimal choice for the server. Furthermore, we prove the convergence of the best-response algorithm to compute NEs for our FL game. Finally, we apply the training efforts derived from specific NEs to a real-world FL scenario, validating the effectiveness of the identified optimal reward factor.
Bloomingdale's uses machine learning to evaluate employee knowledge Chain Store Age
Bloomingdale's can now pinpoint which of its employee learning programs are generating results -- and by how much in real dollars. The Macy's division has deployed Axonify Impact, (from Axonify), a learning attribution engine that uses machine learning to evaluate the data collected through training programs. Results reveal the direct impact that employee training programs are having on real business metrics, such as increases in revenue or decreases in expenditures. As employees interact with the platform, the technology's machine learning capabilities reveal which programs are generating the greatest impact, and how employee knowledge and participation influence business results. It also uncovers gaps, and makes real-time recommendations to frontline managers when a business target is at risk.
Tree-CNN: A Deep Convolutional Neural Network for Lifelong Learning
Roy, Deboleena, Panda, Priyadarshini, Roy, Kaushik
In recent years, Convolutional Neural Networks (CNNs) have shown remarkable performance in many computer vision tasks such as object recognition and detection. However, complex training issues, such as "catastrophic forgetting" and hyper-parameter tuning, make incremental learning in CNNs a difficult challenge. In this paper, we propose a hierarchical deep neural network, with CNNs at multiple levels, and a corresponding training method for lifelong learning. The network grows in a tree-like manner to accommodate the new classes of data without losing the ability to identify the previously trained classes. The proposed network was tested on CIFAR-10 and CIFAR-100 datasets, and compared against the method of fine tuning specific layers of a conventional CNN. We obtained comparable accuracies and achieved 40% and 20% reduction in training effort in CIFAR-10 and CIFAR 100 respectively. The network was able to organize the incoming classes of data into feature-driven super-classes. Our model improves upon existing hierarchical CNN models by adding the capability of self-growth and also yields important observations on feature selective classification.
Using Deep Learning to Find Insights in Mounds of Messy Data
Deep learning allows us to teach a computer by example. This enables a knowledge worker to throw examples at the computer and use them to teach it how they want their data to be analyzed and understood. In the context of unstructured data where it is often very difficult to codify all the underlying rules that make something interesting, this goes a long way. This approach allows us to approximate human intuition and is a big part of the reason why deep learning techniques deliver the best accuracies today. Second, is the emergence of transfer learning.