All categories
Tools & Automation
CLI tools, utilities, converters, workflow automation, and productivity helpers
- 49,210
- 2,051
Security grades appear on each card once the skill has been scanned. Newly imported skills may briefly show without a grade until the backfill job runs.
Open in full browserBrowse tools & automation skills
Showing 19,225–19,248 of 49,210 skills
- Reducing Catastrophic Forgetting When Evolving Neural Networks**arXiv ID:** 1904.03178 **Authors:** Joseph Early **Published:** 2019-04-05T17:57:29Z **Abstract:** A key stepping stone in the development of an artificial general intelligence (a machine that can perform any task), is the production of agents that can perform multiple tasks at once instead of just one. Unfortunately, canonical methods are very prone to catastrophic forgetting (CF) - the act of overwriting previous knowledge about a task when learning a new task. Recent efforts have develop...Votes: 0GitHub stars: 3
- React Revealing Evolutionary Action Consequence Trajectories For Interpretable Reinforcement Learning**arXiv ID:** 2404.03359 **Authors:** Philipp Altmann, Céline Davignon, Maximilian Zorn, Fabian Ritz, Claudia Linnhoff-Popien, Thomas Gabor **Published:** 2024-04-04T10:56:30Z **Abstract:** To enhance the interpretability of Reinforcement Learning (RL), we propose Revealing Evolutionary Action Consequence Trajectories (REACT). In contrast to the prevalent practice of validating RL models based on their optimal behavior learned during training, we posit that considering a range of edge-case tr...Votes: 0GitHub stars: 3
- Rapid Tasksolving In Novel Environments**arXiv ID:** 2006.03662 **Authors:** Sam Ritter, Ryan Faulkner, Laurent Sartran, Adam Santoro, Matt Botvinick, David Raposo **Published:** 2020-06-05T20:09:20Z **Abstract:** We propose the challenge of rapid task-solving in novel environments (RTS), wherein an agent must solve a series of tasks as rapidly as possible in an unfamiliar environment. An effective RTS agent must balance between exploring the unfamiliar environment and solving its current task, all while building a model of the ne...Votes: 0GitHub stars: 3
- Quantum Deep Q Learning With Distributed Prioritized Experience Replay**arXiv ID:** 2304.09648 **Authors:** Samuel Yen-Chi Chen **Published:** 2023-04-19T13:40:44Z **Abstract:** This paper introduces the QDQN-DPER framework to enhance the efficiency of quantum reinforcement learning (QRL) in solving sequential decision tasks. The framework incorporates prioritized experience replay and asynchronous training into the training algorithm to reduce the high sampling complexities. Numerical simulations demonstrate that QDQN-DPER outperforms the baseline distributed ...Votes: 0GitHub stars: 3
- Proximal Policy Optimization With Evolutionary Mutations**arXiv ID:** 2601.14705 **Authors:** Casimir Czworkowski, Stephen Hornish, Alhassan S. Yasin **Published:** 2026-01-21T06:34:53Z **Abstract:** Proximal Policy Optimization (PPO) is a widely used reinforcement learning algorithm known for its stability and sample efficiency, but it often suffers from premature convergence due to limited exploration. In this paper, we propose POEM (Proximal Policy Optimization with Evolutionary Mutations), a novel modification to PPO that introduces an adaptiv...Votes: 0GitHub stars: 3
- Playing The Lottery With Rewards And Multiple Languages Lottery Tickets In Rl And Nlp**arXiv ID:** 1906.02768 **Authors:** Haonan Yu, Sergey Edunov, Yuandong Tian, Ari S. Morcos **Published:** 2019-06-06T18:38:38Z **Abstract:** The lottery ticket hypothesis proposes that over-parameterization of deep neural networks (DNNs) aids training by increasing the probability of a "lucky" sub-network initialization being present rather than by helping the optimization process (Frankle & Carbin, 2019). Intriguingly, this phenomenon suggests that initialization strategies for DNNs can be...Votes: 0GitHub stars: 3
- Pdeflow Autonomous Agentic Pde PipelinesPDEFlow: an autonomous agentic framework that turns user-level ODE/PDE descriptions into solver-backed neural-operator pipelines. Links problem specification, data generation, operator training, and checkpoint-based inference via a stateful input graph and registry-based interface. Instantiated with multi-branch Bayesian DeepONet. Activation: PDEFlow, autonomous PDE solver, neural operator, agentic pipeline, DeepONet, FEniCSx, ODE PDE automation, scientific workflow, Bayesian DeepONet, operat...Votes: 0GitHub stars: 3
- Particle Swarm Optimization For Generating Interpretable Fuzzy Reinforcement Learning Policies**arXiv ID:** 1610.05984 **Authors:** Daniel Hein, Alexander Hentschel, Thomas Runkler, Steffen Udluft **Published:** 2016-10-19T12:41:52Z **Abstract:** Fuzzy controllers are efficient and interpretable system controllers for continuous state and action spaces. To date, such controllers have been constructed manually or trained automatically either using expert-generated problem-specific cost functions or incorporating detailed knowledge about the optimal control strategy. Both requirements f...Votes: 0GitHub stars: 3
- Parallel Exploration Via Negatively Correlated Search**arXiv ID:** 1910.07151 **Authors:** Peng Yang, Qi Yang, Ke Tang, Xin Yao **Published:** 2019-10-16T03:30:29Z **Abstract:** Effective exploration is a key to successful search. The recently proposed Negatively Correlated Search (NCS) tries to achieve this by parallel exploration, where a set of search processes are driven to be negatively correlated so that different promising areas of the search space can be visited simultaneously. Various applications have verified the advantages of such n...Votes: 0GitHub stars: 3
- On The Importance Of Critical Period In Multistage Reinforcement Learning**arXiv ID:** 2208.04832 **Authors:** Junseok Park, Inwoo Hwang, Min Whoo Lee, Hyunseok Oh, Minsu Lee, Youngki Lee, Byoung-Tak Zhang **Published:** 2022-08-09T15:17:22Z **Abstract:** The initial years of an infant's life are known as the critical period, during which the overall development of learning performance is significantly impacted due to neural plasticity. In recent studies, an AI agent, with a deep neural network mimicking mechanisms of actual neurons, exhibited a learning period si...Votes: 0GitHub stars: 3
- On The Convergence And Stability Of Upsidedown Reinforcement Learning Goalconditioned Supervised Learning And Online Decision Transformers**arXiv ID:** 2502.05672 **Authors:** Miroslav Štrupl, Oleg Szehr, Francesco Faccio, Dylan R. Ashley, Rupesh Kumar Srivastava, Jürgen Schmidhuber **Published:** 2025-02-08T19:26:22Z **Abstract:** This article provides a rigorous analysis of convergence and stability of Episodic Upside-Down Reinforcement Learning, Goal-Conditioned Supervised Learning and Online Decision Transformers. These algorithms performed competitively across various benchmarks, from games to robotic tasks, but their theo...Votes: 0GitHub stars: 3
- Npas A Compileraware Framework Of Unified Network Pruning And Architecture Search For Beyond Realtime Mobile Acceleration**arXiv ID:** 2012.00596 **Authors:** Zhengang Li, Geng Yuan, Wei Niu, Pu Zhao, Yanyu Li, Yuxuan Cai, Xuan Shen, Zheng Zhan, Zhenglun Kong, Qing Jin, Zhiyu Chen, Sijia Liu, Kaiyuan Yang, Bin Ren, Yanzhi Wang, Xue Lin **Published:** 2020-12-01T16:03:40Z **Abstract:** With the increasing demand to efficiently deploy DNNs on mobile edge devices, it becomes much more important to reduce unnecessary computation and increase the execution speed. Prior methods towards this goal, including model comp...Votes: 0GitHub stars: 3
- Nonmarkovian Control With Gated Endtoend Memory Policy Networks**arXiv ID:** 1705.10993 **Authors:** Julien Perez, Tomi Silander **Published:** 2017-05-31T09:00:44Z **Abstract:** Partially observable environments present an important open challenge in the domain of sequential control learning with delayed rewards. Despite numerous attempts during the two last decades, the majority of reinforcement learning algorithms and associated approximate models, applied to this context, still assume Markovian state transitions. In this paper, we explore the use of ...Votes: 0GitHub stars: 3
- Neural Architecture Search With Reinforcement Learning**arXiv ID:** 1611.01578 **Authors:** Barret Zoph, Quoc V. Le **Published:** 2016-11-05T00:41:37Z **Abstract:** Neural networks are powerful and flexible models that work well for many difficult learning tasks in image, speech and natural language understanding. Despite their success, neural networks are still hard to design. In this paper, we use a recurrent network to generate the model descriptions of neural networks and train this RNN with reinforcement learning to maximize the expected a...Votes: 0GitHub stars: 3
- Multiobjective Modelbased Policy Search For Dataefficient Learning With Sparse Rewards**arXiv ID:** 1806.09351 **Authors:** Rituraj Kaushik, Konstantinos Chatzilygeroudis, Jean-Baptiste Mouret **Published:** 2018-06-25T09:46:47Z **Abstract:** The most data-efficient algorithms for reinforcement learning in robotics are model-based policy search algorithms, which alternate between learning a dynamical model of the robot and optimizing a policy to maximize the expected return given the model and its uncertainties. However, the current algorithms lack an effective exploration str...Votes: 0GitHub stars: 3
- Multi Agent FormalizationSkill for AI agent capabilitiesVotes: 0GitHub stars: 3
- Modularity In Reinforcement Learning Via Algorithmic Independence In Credit Assignment**arXiv ID:** 2106.14993 **Authors:** Michael Chang, Sidhant Kaushik, Sergey Levine, Thomas L. Griffiths **Published:** 2021-06-28T21:29:13Z **Abstract:** Many transfer problems require re-using previously optimal decisions for solving new tasks, which suggests the need for learning algorithms that can modify the mechanisms for choosing certain actions independently of those for choosing others. However, there is currently no formalism nor theory for how to achieve this kind of modular credit...Votes: 0GitHub stars: 3
- Maximum Mutation Reinforcement Learning For Scalable Control**arXiv ID:** 2007.13690 **Authors:** Karush Suri, Xiao Qi Shi, Konstantinos N. Plataniotis, Yuri A. Lawryshyn **Published:** 2020-07-24T16:29:19Z **Abstract:** Advances in Reinforcement Learning (RL) have demonstrated data efficiency and optimal control over large state spaces at the cost of scalable performance. Genetic methods, on the other hand, provide scalability but depict hyperparameter sensitivity towards evolutionary operations. However, a combination of the two methods has recently...Votes: 0GitHub stars: 3
- Marketbased Reinforcement Learning In Partially Observable Worlds**arXiv ID:** 0105025v1 **Authors:** Ivo Kwee, Marcus Hutter, Juergen Schmidhuber **Published:** 2001-05-15T19:07:28Z **Abstract:** Unlike traditional reinforcement learning (RL), market-based RL is in principle applicable to worlds described by partially observable Markov Decision Processes (POMDPs), where an agent needs to learn short-term memories of relevant previous events in order to execute optimal actions. Most previous work, however, has focused on reactive settings (MDPs) instead of...Votes: 0GitHub stars: 3
- Llms And Agentic Ai Systems For Smart Grids A TutoDerived from arXiv:2607.18147 - LLMs and Agentic AI Systems for Smart Grids: A Tutorial on Architectures and ApplicationsVotes: 0GitHub stars: 3
- Lifetime Policy Reuse And The Importance Of Task Capacity**arXiv ID:** 2106.01741 **Authors:** David M. Bossens, Adam J. Sobey **Published:** 2021-06-03T10:42:49Z **Abstract:** A long-standing challenge in artificial intelligence is lifelong reinforcement learning, where learners are given many tasks in sequence and must transfer knowledge between tasks while avoiding catastrophic forgetting. Policy reuse and other multi-policy reinforcement learning techniques can learn multiple tasks but may generate many policies. This paper presents two novel c...Votes: 0GitHub stars: 3
- Learning Values Across Many Orders Of Magnitude**arXiv ID:** 1602.07714 **Authors:** Hado van Hasselt, Arthur Guez, Matteo Hessel, Volodymyr Mnih, David Silver **Published:** 2016-02-24T21:14:52Z **Abstract:** Most learning algorithms are not invariant to the scale of the function that is being approximated. We propose to adaptively normalize the targets used in learning. This is useful in value-based reinforcement learning, where the magnitude of appropriate value approximations can change over time when we update the policy of behavior....Votes: 0GitHub stars: 3
- Learning Controllable 3d Level Generators**arXiv ID:** 2206.13623 **Authors:** Zehua Jiang, Sam Earle, Michael Cerny Green, Julian Togelius **Published:** 2022-06-27T20:43:56Z **Abstract:** Procedural Content Generation via Reinforcement Learning (PCGRL) foregoes the need for large human-authored data-sets and allows agents to train explicitly on functional constraints, using computable, user-defined measures of quality instead of target output. We explore the application of PCGRL to 3D domains, in which content-generation tasks nat...Votes: 0GitHub stars: 3
- Learning And Improving Backgammon Strategy**arXiv ID:** 2504.02221 **Authors:** Gregory R. Galperin **Published:** 2025-04-03T02:27:22Z **Abstract:** A novel approach to learning is presented, combining features of on-line and off-line methods to achieve considerable performance in the task of learning a backgammon value function in a process that exploits the processing power of parallel supercomputers. The off-line methods comprise a set of techniques for parallelizing neural network training and $TD(λ)$ reinforcement learning; her...Votes: 0GitHub stars: 3