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,201–19,224 of 49,210 skills
- Neural Qaoa Differentiable OptimizationNeural QAOA² methodology: end-to-end differentiable framework for joint graph partitioning and QAOA parameter initialization. Uses generative evaluative network (GEN) with differentiable quantum evaluator for gradient-guided learning. Ranks first on 101/183 instances with zero-shot generalization. Activation: neural QAOA, quantum optimization initialization, graph partitioning QAOA, differentiable quantum, QAOA2.Votes: 0GitHub stars: 3
- Neural Dynamics Universal Translator神经动力学通用翻译器方法论。在单细胞、单脉冲分辨率下翻译不同神经模型的动力学,实现跨模型动力学对齐。适用于神经元模型转换、动力学分析、计算神经科学。触发词:神经动力学、模型翻译、脉冲分辨率、神经元模型、neural dynamics、universal translator、single-spike。Votes: 0GitHub stars: 3
- Multiparameter Hamiltonian EstimationOptimal multiparameter estimation for quantum systems using the unified Cramér-Rao bound framework. Use when: (1) estimating functions of multiple parameters in quantum Hamiltonians, (2) designing quantum sensing protocols, (3) analyzing precision limits for non-commuting generators, (4) optimizing quantum metrology with multiple parameters. Based on arXiv:2605.04136.Votes: 0GitHub stars: 3
- Zerocost Proxies For Lightweight Nas**arXiv ID:** 2101.08134 **Authors:** Mohamed S. Abdelfattah, Abhinav Mehrotra, Łukasz Dudziak, Nicholas D. Lane **Published:** 2021-01-20T13:59:52Z **Abstract:** Neural Architecture Search (NAS) is quickly becoming the standard methodology to design neural network models. However, NAS is typically compute-intensive because multiple models need to be evaluated before choosing the best one. To reduce the computational power and time needed, a proxy task is often used for evaluating each model ...Votes: 0GitHub stars: 3
- Winning Isnt Everything Enhancing Game Development With Intelligent Agents**arXiv ID:** 1903.10545 **Authors:** Yunqi Zhao, Igor Borovikov, Fernando de Mesentier Silva, Ahmad Beirami, Jason Rupert, Caedmon Somers, Jesse Harder, John Kolen, Jervis Pinto, Reza Pourabolghasem, James Pestrak, Harold Chaput, Mohsen Sardari, Long Lin, Sundeep Narravula, Navid Aghdaie, Kazi Zaman **Published:** 2019-03-25T18:39:04Z **Abstract:** Recently, there have been several high-profile achievements of agents learning to play games against humans and beat them. In this paper, we stud...Votes: 0GitHub stars: 3
- Vmavc A Deep Attentionbased Reinforcement Learning Algorithm For Modelbased Control**arXiv ID:** 1812.09968 **Authors:** Xingxing Liang, Qi Wang, Yanghe Feng, Zhong Liu, Jincai Huang **Published:** 2018-12-24T19:25:23Z **Abstract:** Recent breakthroughs in Go play and strategic games have witnessed the great potential of reinforcement learning in intelligently scheduling in uncertain environment, but some bottlenecks are also encountered when we generalize this paradigm to universal complex tasks. Among them, the low efficiency of data utilization in model-free reinforcemen...Votes: 0GitHub stars: 3
- Video Game Level Design As A Multiagent Reinforcement Learning Problem**arXiv ID:** 2510.04862 **Authors:** Sam Earle, Zehua Jiang, Eugene Vinitsky, Julian Togelius **Published:** 2025-10-06T14:49:21Z **Abstract:** Procedural Content Generation via Reinforcement Learning (PCGRL) offers a method for training controllable level designer agents without the need for human datasets, using metrics that serve as proxies for level quality as rewards. Existing PCGRL research focuses on single generator agents, but are bottlenecked by the need to frequently recalculate h...Votes: 0GitHub stars: 3
- Using Monte Carlo Tree Search As A Demonstrator Within Asynchronous Deep Rl**arXiv ID:** 1812.00045 **Authors:** Bilal Kartal, Pablo Hernandez-Leal, Matthew E. Taylor **Published:** 2018-11-30T20:37:17Z **Abstract:** Deep reinforcement learning (DRL) has achieved great successes in recent years with the help of novel methods and higher compute power. However, there are still several challenges to be addressed such as convergence to locally optimal policies and long training times. In this paper, firstly, we augment Asynchronous Advantage Actor-Critic (A3C) method wi...Votes: 0GitHub stars: 3
- Unsupervised Learning Of Temporal Abstractions With Slotbased Transformers**arXiv ID:** 2203.13573 **Authors:** Anand Gopalakrishnan, Kazuki Irie, Jürgen Schmidhuber, Sjoerd van Steenkiste **Published:** 2022-03-25T10:59:46Z **Abstract:** The discovery of reusable sub-routines simplifies decision-making and planning in complex reinforcement learning problems. Previous approaches propose to learn such temporal abstractions in a purely unsupervised fashion through observing state-action trajectories gathered from executing a policy. However, a current limitation is t...Votes: 0GitHub stars: 3
- Unbiased Recovery Policy GradientSafeExplorer - drop-in PPO modification for RL with a deterministic recovery policy that prevents silent bias in on-policy updates. Uses score-function estimator only at safe timesteps, never evaluates recovery-policy density, so it stays valid where importance sampling breaks. Use when training RL agents on real robots / safety-critical systems where falls/crashes are costly and a separate recovery controller is engaged inside the safe region.Votes: 0GitHub stars: 3
- Treeqn And Atreec Differentiable Treestructured Models For Deep Reinforcement Learning**arXiv ID:** 1710.11417 **Authors:** Gregory Farquhar, Tim Rocktäschel, Maximilian Igl, Shimon Whiteson **Published:** 2017-10-31T11:54:35Z **Abstract:** Combining deep model-free reinforcement learning with on-line planning is a promising approach to building on the successes of deep RL. On-line planning with look-ahead trees has proven successful in environments where transition models are known a priori. However, in complex environments where transition models need to be learned from data...Votes: 0GitHub stars: 3
- Towards Mental Time Travel A Hierarchical Memory For Reinforcement Learning Agents**arXiv ID:** 2105.14039 **Authors:** Andrew Kyle Lampinen, Stephanie C. Y. Chan, Andrea Banino, Felix Hill **Published:** 2021-05-28T18:12:28Z **Abstract:** Reinforcement learning agents often forget details of the past, especially after delays or distractor tasks. Agents with common memory architectures struggle to recall and integrate across multiple timesteps of a past event, or even to recall the details of a single timestep that is followed by distractor tasks. To address these limitati...Votes: 0GitHub stars: 3
- Towards Humanlike Driving Active Inference In Autonomous Vehicle Control**arXiv ID:** 2407.07684 **Authors:** Elahe Delavari, John Moore, Junho Hong, Jaerock Kwon **Published:** 2024-07-10T14:08:27Z **Abstract:** This paper presents a novel approach to Autonomous Vehicle (AV) control through the application of active inference, a theory derived from neuroscience that conceptualizes the brain as a predictive machine. Traditional autonomous driving systems rely heavily on Modular Pipelines, Imitation Learning, or Reinforcement Learning, each with inherent limitatio...Votes: 0GitHub stars: 3
- Towards Empathic Deep Qlearning**arXiv ID:** 1906.10918 **Authors:** Bart Bussmann, Jacqueline Heinerman, Joel Lehman **Published:** 2019-06-26T08:59:02Z **Abstract:** As reinforcement learning (RL) scales to solve increasingly complex tasks, interest continues to grow in the fields of AI safety and machine ethics. As a contribution to these fields, this paper introduces an extension to Deep Q-Networks (DQNs), called Empathic DQN, that is loosely inspired both by empathy and the golden rule ("Do unto others as you would ha...Votes: 0GitHub stars: 3
- Toward Preferencealigned Large Language Models Via Residualbased Model Steering**arXiv ID:** 2509.23982 **Authors:** Lucio La Cava, Andrea Tagarelli **Published:** 2025-09-28T17:16:16Z **Abstract:** Preference alignment is a critical step in making Large Language Models (LLMs) useful and aligned with (human) preferences. Existing approaches such as Reinforcement Learning from Human Feedback or Direct Preference Optimization typically require curated data and expensive optimization over billions of parameters, and eventually lead to persistent task-specific models. In th...Votes: 0GitHub stars: 3
- Synergizing Qualitydiversity With Descriptorconditioned Reinforcement Learning**arXiv ID:** 2401.08632 **Authors:** Maxence Faldor, Félix Chalumeau, Manon Flageat, Antoine Cully **Published:** 2023-12-10T19:53:15Z **Abstract:** A hallmark of intelligence is the ability to exhibit a wide range of effective behaviors. Inspired by this principle, Quality-Diversity algorithms, such as MAP-Elites, are evolutionary methods designed to generate a set of diverse and high-fitness solutions. However, as a genetic algorithm, MAP-Elites relies on random mutations, which can become...Votes: 0GitHub stars: 3
- Switchbased Active Deep Dynaq Efficient Adaptive Planning For Taskcompletion Dialogue Policy Learning**arXiv ID:** 1811.07550 **Authors:** Yuexin Wu, Xiujun Li, Jingjing Liu, Jianfeng Gao, Yiming Yang **Published:** 2018-11-19T08:23:34Z **Abstract:** Training task-completion dialogue agents with reinforcement learning usually requires a large number of real user experiences. The Dyna-Q algorithm extends Q-learning by integrating a world model, and thus can effectively boost training efficiency using simulated experiences generated by the world model. The effectiveness of Dyna-Q, however, dep...Votes: 0GitHub stars: 3
- Sparse Meta Networks For Sequential Adaptation And Its Application To Adaptive Language Modelling**arXiv ID:** 2009.01803 **Authors:** Tsendsuren Munkhdalai **Published:** 2020-09-03T17:06:52Z **Abstract:** Training a deep neural network requires a large amount of single-task data and involves a long time-consuming optimization phase. This is not scalable to complex, realistic environments with new unexpected changes. Humans can perform fast incremental learning on the fly and memory systems in the brain play a critical role. We introduce Sparse Meta Networks -- a meta-learning approach ...Votes: 0GitHub stars: 3
- Spacellagent A Self Evolving Llm Based Multi Agent Framework For TrajectorySpatial and Single-cell transcriptomics are transformative in deciphering cellular dynamics. As the fundamental paradigm for reconstructing cell developmental paths, trajectory inference (TI) is criti. Based on arXiv:2607.07467.Votes: 0GitHub stars: 3
- Silent Failures In Multimodal Agentic Searcha DiagSkill generated from arXiv paper 2607.19793: Silent Failures in Multimodal Agentic Search:A Diagnostic Taxonomy and Cross-Judge EvaluationVotes: 0GitHub stars: 3
- Shortcut Trajectory Planning Offline RlSingle-stage shortcut-model trajectory planner for efficient offline model-based RL. Replaces two-stage consistency-distillation with one-stage step-size-conditioned shortcut models + feasibility-aware critic for fast one/few-step generative planning. Use when building fast diffusion-based planners for offline RL (D4RL) without the training cost/instability of teacher-student distillation.Votes: 0GitHub stars: 3
- Selfevidencing Through Hierarchical Gradient Decomposition A Dissipative System That Maintains Nonequilibrium Steadystate By Minimizing Variational Free Energy**arXiv ID:** 2510.17916 **Authors:** Michael James McCulloch **Published:** 2025-10-20T00:19:32Z **Abstract:** The Free Energy Principle (FEP) states that self-organizing systems must minimize variational free energy to persist, but the path from principle to implementable algorithm has remained unclear. We present a constructive proof that the FEP can be realized through exact local credit assignment. The system decomposes gradient computation hierarchically: spatial credit via feedback ali...Votes: 0GitHub stars: 3
- Rp Regret Adaptive OpponentsRepeated Policy Regret (RP-Regret) methodology for regret minimization in repeated games with adaptive opponents — addresses limitations of external regret when opponents respond to history of play.Votes: 0GitHub stars: 3
- Reinforcement Learning With Chromatic Networks For Compact Architecture Search**arXiv ID:** 1907.06511 **Authors:** Xingyou Song, Krzysztof Choromanski, Jack Parker-Holder, Yunhao Tang, Wenbo Gao, Aldo Pacchiano, Tamas Sarlos, Deepali Jain, Yuxiang Yang **Published:** 2019-07-10T16:57:50Z **Abstract:** We present a neural architecture search algorithm to construct compact reinforcement learning (RL) policies, by combining ENAS and ES in a highly scalable and intuitive way. By defining the combinatorial search space of NAS to be the set of different edge-partitionings (...Votes: 0GitHub stars: 3