Goto

Collaborating Authors

 Instructional Material


Supplementary Material for " Training Over-parameterized Models with Non-decomposable Objectives " Algorithm 2 Reductions-based Algorithm for Constraining Coverage (2)

Neural Information Processing Systems

These algorithms additionally incorporate the "two dataset" trick suggested by Cotter et al. We will find the following standard result to be useful in our proofs. We reproduce the proof from Narasimhan et al. We provide a proof for Proposition 4 . The proof follows by setting D = G and applying Proposition 4 .




Calibrating CNNs for Lifelong Learning

Neural Information Processing Systems

We present an approach for lifelong/continual learning of convolutional neural networks (CNN) that does not suffer from the problem of catastrophic forgetting when moving from one task to the other. We show that the activation maps generated by the CNN trained on the old task can be calibrated using very few calibration parameters, to become relevant to the new task.


Scalable Online Planning via Reinforcement Learning Fine-Tuning

Neural Information Processing Systems

Lookahead search has been a critical component of recent AI successes, such as in the games of chess, go, and poker. However, the search methods used in these games, and in many other settings, are tabular. Tabular search methods do not scale well with the size of the search space, and this problem is exacerbated by stochasticity and partial observability. In this work we replace tabular search with online model-based fine-tuning of a policy neural network via reinforcement learning, and show that this approach outperforms state-of-the-art search algorithms in benchmark settings. In particular, we use our search algorithm to achieve a new state-of-the-art result in self-play Hanabi, and show the generality of our algorithm by also showing that it outperforms tabular search in the Atari game Ms. Pacman.



Windows 11 Notepad gets improved context menus in latest update

PCWorld

Ever since Microsoft killed WordPad in 2024, the much-simpler Notepad app has been receiving several new features--almost as if it's evolving into a better, more modern version of WordPad. Meanwhile, Microsoft is introducing an even simpler text editor called Edit. Some of the recent additions to Notepad include spell check, AI-generated text, and Markdown formatting--and the improvements aren't done yet. The latest news is that Notepad will soon have updated context menus in Windows 11, reports Neowin. In Notepad version 11.2507.26.0, which is currently rolling out to Windows Insiders, the updated context menu now matches the look of Windows 11 24H2's context menus, with quick actions for Copy, Cut, Paste, Select all, and Delete, plus other actions like Write, Rewrite, Summarize, Define with Bing, and more.


Online Meta-Learning via Learning with Layer-Distributed Memory

Neural Information Processing Systems

We demonstrate that efficient meta-learning can be achieved via end-to-end training of deep neural networks with memory distributed across layers. The persistent state of this memory assumes the entire burden of guiding task adaptation. Moreover, its distributed nature is instrumental in orchestrating adaptation.