中文
相关论文

相关论文: Interpolating Between Softmax Policy Gradient and …

200 篇论文

We consider un-discounted reinforcement learning (RL) in Markov decision processes (MDPs) under temporal drifts, ie, both the reward and state transition distributions are allowed to evolve over time, as long as their respective total…

机器学习 · 计算机科学 2020-05-19 Wang Chi Cheung , David Simchi-Levi , Ruihao Zhu

Many reinforcement learning (RL) algorithms are impractical for training in operational systems or computationally expensive high-fidelity simulations, as they require large amounts of data. Meanwhile, low-fidelity simulators, e.g.,…

We consider un-discounted reinforcement learning (RL) in Markov decision processes (MDPs) under drifting non-stationarity, i.e., both the reward and state transition distributions are allowed to evolve over time, as long as their respective…

机器学习 · 计算机科学 2020-06-26 Wang Chi Cheung , David Simchi-Levi , Ruihao Zhu

Standard knowledge distillation for autoregressive models often suffers from distribution mismatch. While on-policy methods mitigate this by leveraging student-generated outputs, they rely on computationally expensive Reinforcement Learning…

机器学习 · 计算机科学 2026-05-08 Miao Rang , Zhenni Bi , Hang Zhou , Kai Han , Xuechun Wang , An Xiao , Xinghao Chen , Yunhe Wang , Hanting Chen

Spiking neural networks (SNNs) with event-based computation are promising brain-inspired models for energy-efficient applications on neuromorphic hardware. However, most supervised SNN training methods, such as conversion from artificial…

神经与进化计算 · 计算机科学 2023-02-02 Mingqing Xiao , Qingyan Meng , Zongpeng Zhang , Yisen Wang , Zhouchen Lin

Existing value-based online reinforcement learning (RL) algorithms suffer from slow policy exploitation due to ineffective exploration and delayed policy updates. To address these challenges, we propose an algorithm called Instant…

机器学习 · 计算机科学 2026-02-18 Gong Gao , Weidong Zhao , Xianhui Liu , Ning Jia

By ensuring differential privacy in the learning algorithms, one can rigorously mitigate the risk of large models memorizing sensitive training data. In this paper, we study two algorithms for this purpose, i.e., DP-SGD and DP-NSGD, which…

机器学习 · 计算机科学 2022-06-28 Xiaodong Yang , Huishuai Zhang , Wei Chen , Tie-Yan Liu

Intrinsic rewards play a central role in handling the exploration-exploitation trade-off when designing sequential decision-making algorithms, in both foundational theory and state-of-the-art deep reinforcement learning. The LinUCB…

机器学习 · 计算机科学 2022-04-13 Jordan T. Ash , Cyril Zhang , Surbhi Goel , Akshay Krishnamurthy , Sham Kakade

Adversarial attacks on deep neural network models have seen rapid development and are extensively used to study the stability of these networks. Among various adversarial strategies, Projected Gradient Descent (PGD) is a widely adopted…

机器学习 · 计算机科学 2024-10-17 Dayana Savostianova , Emanuele Zangrando , Francesco Tudisco

Recent studies have highlighted the vulnerability of deep neural networks to backdoor attacks, where models are manipulated to rely on embedded triggers within poisoned samples, despite the presence of both benign and trigger information.…

密码学与安全 · 计算机科学 2025-02-27 Mingli Zhu , Shaokui Wei , Hongyuan Zha , Baoyuan Wu

Spiking Neural Networks (SNNs) may offer an energy-efficient alternative for implementing deep learning applications. In recent years, there have been several proposals focused on supervised (conversion, spike-based gradient descent) and…

计算机视觉与模式识别 · 计算机科学 2019-10-31 Priyadarshini Panda , Aparna Aketi , Kaushik Roy

In standard Deep Neural Network (DNN) based classifiers, the general convention is to omit the activation function in the last (output) layer and directly apply the softmax function on the logits to get the probability scores of each class.…

机器学习 · 计算机科学 2022-05-17 Omer Faruk Tuna , Ferhat Ozgur Catak , M. Taner Eskil

Policy optimization is a widely-used method in reinforcement learning. Due to its local-search nature, however, theoretical guarantees on global optimality often rely on extra assumptions on the Markov Decision Processes (MDPs) that bypass…

机器学习 · 计算机科学 2021-07-20 Haipeng Luo , Chen-Yu Wei , Chung-Wei Lee

As neural networks make their way into safety-critical systems, where misbehavior can lead to catastrophes, there is a growing interest in certifying the equivalence of two structurally similar neural networks. For example, compression…

机器学习 · 计算机科学 2020-09-22 Brandon Paulsen , Jingbo Wang , Jiawei Wang , Chao Wang

Different gradient-based methods for optimizing overparameterized models can all achieve zero training error yet converge to distinctly different solutions inducing different generalization properties. We provide the first complete…

机器学习 · 计算机科学 2025-12-08 Chen Fan , Mark Schmidt , Christos Thrampoulidis

One of the bottlenecks preventing Deep Reinforcement Learning algorithms (DRL) from real-world applications is how to explore the environment and collect informative transitions efficiently. The present paper describes bounded exploration,…

机器学习 · 计算机科学 2024-12-10 Ting Qiao , Henry Williams , David Valencia , Bruce MacDonald

A neurochip is a device that reproduces the signal processing mechanisms of brain neurons and calculates Spiking Neural Networks (SNNs) with low power consumption and at high speed. Thus, neurochips are attracting attention from edge robot…

机器人学 · 计算机科学 2024-12-11 Yuki Kadokawa , Tomohito Kodera , Yoshihisa Tsurumine , Shinya Nishimura , Takamitsu Matsubara

Even for the gradient descent (GD) method applied to neural network training, understanding its optimization dynamics, including convergence rate, iterate trajectories, function value oscillations, and especially its implicit acceleration,…

机器学习 · 计算机科学 2026-05-22 Alexander Tyurin

Gated Recurrent Unit (GRU) is a recently-developed variation of the long short-term memory (LSTM) unit, both of which are types of recurrent neural network (RNN). Through empirical evidence, both models have been proven to be effective in a…

神经与进化计算 · 计算机科学 2019-02-08 Abien Fred Agarap

Counterfactual regret minimization (CFR) is a family of iterative algorithms that are the most popular and, in practice, fastest approach to approximately solving large imperfect-information games. In this paper we introduce novel CFR…

计算机科学与博弈论 · 计算机科学 2019-02-22 Noam Brown , Tuomas Sandholm