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,537–19,560 of 49,210 skills
- Testtime Regression A Unifying Framework For Designing Sequence Models With Associative Memory**arXiv ID:** 2501.12352 **Authors:** Ke Alexander Wang, Jiaxin Shi, Emily B. Fox **Published:** 2025-01-21T18:32:31Z **Abstract:** Sequence models lie at the heart of modern deep learning. However, rapid advancements have produced a diversity of seemingly unrelated architectures, such as Transformers and recurrent alternatives. In this paper, we introduce a unifying framework to understand and derive these sequence models, inspired by the empirical importance of associative recall, the capab...Votes: 0GitHub stars: 3
- Synthetic Benchmarks Overstate Forwardforward Scaling Realdata Limits Of Layerlocal Training**arXiv ID:** 2606.06539 **Authors:** Yucheng Chen **Published:** 2026-06-04T04:01:01Z **Abstract:** Forward-Forward (FF) learning [Hinton, 2022] replaces backpropagation with strictly layer-local goodness updates. Recent FF-CNN work has narrowed the gap to BP on 32x32 benchmarks, raising the question of whether layer-local training is becoming a viable alternative at realistic scale. To probe this rigorously, we develop DTG-FF -- dynamic temperature goodness, decoupled normalization, and mul...Votes: 0GitHub stars: 3
- Stein Variational Evolution Strategies**arXiv ID:** 2410.10390 **Authors:** Cornelius V. Braun, Robert T. Lange, Marc Toussaint **Published:** 2024-10-14T11:24:41Z **Abstract:** Stein Variational Gradient Descent (SVGD) is a highly efficient method to sample from an unnormalized probability distribution. However, the SVGD update relies on gradients of the log-density, which may not always be available. Existing gradient-free versions of SVGD make use of simple Monte Carlo approximations or gradients from surrogate distributions, ...Votes: 0GitHub stars: 3
- Star Synthesis Of Tailored Architectures**arXiv ID:** 2411.17800 **Authors:** Armin W. Thomas, Rom Parnichkun, Alexander Amini, Stefano Massaroli, Michael Poli **Published:** 2024-11-26T18:42:42Z **Abstract:** Iterative improvement of model architectures is fundamental to deep learning: Transformers first enabled scaling, and recent advances in model hybridization have pushed the quality-efficiency frontier. However, optimizing architectures remains challenging and expensive. Current automated or manual approaches fall short, large...Votes: 0GitHub stars: 3
- Speqnets Sparsityaware Permutationequivariant Graph Networks**arXiv ID:** 2203.13913 **Authors:** Christopher Morris, Gaurav Rattan, Sandra Kiefer, Siamak Ravanbakhsh **Published:** 2022-03-25T21:17:09Z **Abstract:** While (message-passing) graph neural networks have clear limitations in approximating permutation-equivariant functions over graphs or general relational data, more expressive, higher-order graph neural networks do not scale to large graphs. They either operate on $k$-order tensors or consider all $k$-node subgraphs, implying an exponenti...Votes: 0GitHub stars: 3
- Sparsity In Deep Learning Pruning And Growth For Efficient Inference And Training In Neural Networks**arXiv ID:** 2102.00554 **Authors:** Torsten Hoefler, Dan Alistarh, Tal Ben-Nun, Nikoli Dryden, Alexandra Peste **Published:** 2021-01-31T22:48:50Z **Abstract:** The growing energy and performance costs of deep learning have driven the community to reduce the size of neural networks by selectively pruning components. Similarly to their biological counterparts, sparse networks generalize just as well, if not better than, the original dense networks. Sparsity can reduce the memory footprint of...Votes: 0GitHub stars: 3
- Sparseforge Hessian MaskEfficient semi-structured LLM sparsification via annealing of Hessian-mask guided pruning. Achieves high sparsity with minimal accuracy loss using second-order importance estimation.Votes: 0GitHub stars: 3
- Sevalnas A Searchagnostic Evaluation For Neural Architecture Search**arXiv ID:** 2603.00099 **Authors:** Atah Nuh Mih, Jianzhou Wang, Truong Thanh Hung Nguyen, Hung Cao **Published:** 2026-02-17T15:02:02Z **Abstract:** Neural architecture search (NAS) automates the discovery of neural networks that meet specified criteria, yet its evaluation procedures are often hardcoded, limiting the ability to introduce new metrics. This issue is especially pronounced in hardware-aware NAS, where objectives depend on target devices such as edge hardware. To address this l...Votes: 0GitHub stars: 3
- Self ChallengeSelf-evolution skill that uses dual-agent challenge design and execution to expand capabilities over time.Votes: 0GitHub stars: 3
- Selective Timestep Weighting And Advantage Based Replay For Sample EfficientReinforcement learning from human feedback (RLHF) has emerged as a powerful paradigm for aligning generative models with human preferences. However, applying RLHF to diffusion models remains highly fe. Based on arXiv:2607.07693.Votes: 0GitHub stars: 3
- Recursive Kl Divergence Optimization A Dynamic Framework For Representation Learning**arXiv ID:** 2504.21707 **Authors:** Anthony D Martin **Published:** 2025-04-30T14:51:27Z **Abstract:** We propose a generalization of modern representation learning objectives by reframing them as recursive divergence alignment processes over localized conditional distributions While recent frameworks like Information Contrastive Learning I-Con unify multiple learning paradigms through KL divergence between fixed neighborhood conditionals we argue this view underplays a crucial recursive st...Votes: 0GitHub stars: 3
- Random Projection Forest Initialization For Graph Convolutional Networks**arXiv ID:** 2302.12001 **Authors:** Mashaan Alshammari, John Stavrakakis, Adel F. Ahmed, Masahiro Takatsuka **Published:** 2023-02-22T11:49:19Z **Abstract:** Graph convolutional networks (GCNs) were a great step towards extending deep learning to unstructured data such as graphs. But GCNs still need a constructed graph to work with. To solve this problem, classical graphs such as $k$-nearest neighbor are usually used to initialize the GCN. Although it is computationally efficient to constru...Votes: 0GitHub stars: 3
- Qensemble For Offline Rl Dont Scale The Ensemble Scale The Batch Size**arXiv ID:** 2211.11092 **Authors:** Alexander Nikulin, Vladislav Kurenkov, Denis Tarasov, Dmitry Akimov, Sergey Kolesnikov **Published:** 2022-11-20T21:48:25Z **Abstract:** Training large neural networks is known to be time-consuming, with the learning duration taking days or even weeks. To address this problem, large-batch optimization was introduced. This approach demonstrated that scaling mini-batch sizes with appropriate learning rate adjustments can speed up the training process by ord...Votes: 0GitHub stars: 3
- Polysemanticity And Capacity In Neural Networks**arXiv ID:** 2210.01892 **Authors:** Adam Scherlis, Kshitij Sachan, Adam S. Jermyn, Joe Benton, Buck Shlegeris **Published:** 2022-10-04T20:28:43Z **Abstract:** Individual neurons in neural networks often represent a mixture of unrelated features. This phenomenon, called polysemanticity, can make interpreting neural networks more difficult and so we aim to understand its causes. We propose doing so through the lens of feature \emph{capacity}, which is the fractional dimension each feature co...Votes: 0GitHub stars: 3
- Planktonzilla Multimodal Dataset And Models For Understanding Plankton Ecosystems**arXiv ID:** 2606.00080 **Authors:** Alan Gerson Contreras Montanares, Luis Valenzuela, Luis Martí, Nayat Sanchez-Pi **Published:** 2026-05-22T13:54:57Z **Abstract:** Marine plankton underpin aquatic food webs and play a key role in global CO2 sequestration, making reliable species identification critical for understanding ocean health and climate feedbacks. Existing classification models perform well on individual collections but fail to generalize across instruments and environments due to...Votes: 0GitHub stars: 3
- Piecewise Latent Variables For Neural Variational Text Processing**arXiv ID:** 1612.00377 **Authors:** Iulian V. Serban, Alexander G. Ororbia, Joelle Pineau, Aaron Courville **Published:** 2016-12-01T18:49:23Z **Abstract:** Advances in neural variational inference have facilitated the learning of powerful directed graphical models with continuous latent variables, such as variational autoencoders. The hope is that such models will learn to represent rich, multi-modal latent factors in real-world data, such as natural language text. However, current models ...Votes: 0GitHub stars: 3
- Pateaae Incorporating Adversarial Autoencoder Into Private Aggregation Of Teacher Ensembles For Spoken Command Classification**arXiv ID:** 2104.01271 **Authors:** Chao-Han Huck Yang, Sabato Marco Siniscalchi, Chin-Hui Lee **Published:** 2021-04-02T23:10:57Z **Abstract:** We propose using an adversarial autoencoder (AAE) to replace generative adversarial network (GAN) in the private aggregation of teacher ensembles (PATE), a solution for ensuring differential privacy in speech applications. The AAE architecture allows us to obtain good synthetic speech leveraging upon a discriminative training of latent vectors. Suc...Votes: 0GitHub stars: 3
- Parallel Architecture And Hyperparameter Search Via Successive Halving And Classification**arXiv ID:** 1805.10255 **Authors:** Manoj Kumar, George E. Dahl, Vijay Vasudevan, Mohammad Norouzi **Published:** 2018-05-25T17:12:38Z **Abstract:** We present a simple and powerful algorithm for parallel black box optimization called Successive Halving and Classification (SHAC). The algorithm operates in $K$ stages of parallel function evaluations and trains a cascade of binary classifiers to iteratively cull the undesirable regions of the search space. SHAC is easy to implement, requires ...Votes: 0GitHub stars: 3
- Overcoming Catastrophic Forgetting With Hard Attention To The Task**arXiv ID:** 1801.01423 **Authors:** Joan Serrà, Dídac Surís, Marius Miron, Alexandros Karatzoglou **Published:** 2018-01-04T16:22:22Z **Abstract:** Catastrophic forgetting occurs when a neural network loses the information learned in a previous task after training on subsequent tasks. This problem remains a hurdle for artificial intelligence systems with sequential learning capabilities. In this paper, we propose a task-based hard attention mechanism that preserves previous tasks' informati...Votes: 0GitHub stars: 3
- Oneshot Imitation Learning**arXiv ID:** 1703.07326 **Authors:** Yan Duan, Marcin Andrychowicz, Bradly C. Stadie, Jonathan Ho, Jonas Schneider, Ilya Sutskever, Pieter Abbeel, Wojciech Zaremba **Published:** 2017-03-21T17:22:29Z **Abstract:** Imitation learning has been commonly applied to solve different tasks in isolation. This usually requires either careful feature engineering, or a significant number of samples. This is far from what we desire: ideally, robots should be able to learn from very few demonstrations of...Votes: 0GitHub stars: 3
- On Training Deep Boltzmann Machines**arXiv ID:** 1203.4416 **Authors:** Guillaume Desjardins, Aaron Courville, Yoshua Bengio **Published:** 2012-03-20T12:59:15Z **Abstract:** The deep Boltzmann machine (DBM) has been an important development in the quest for powerful "deep" probabilistic models. To date, simultaneous or joint training of all layers of the DBM has been largely unsuccessful with existing training methods. We introduce a simple regularization scheme that encourages the weight vectors associated with each hidden u...Votes: 0GitHub stars: 3
- On The Improvement Of Generalization And Stability Of Forwardonly Learning Via Neural Polarization**arXiv ID:** 2408.09210 **Authors:** Erik B. Terres-Escudero, Javier Del Ser, Pablo Garcia-Bringas **Published:** 2024-08-17T14:32:18Z **Abstract:** Forward-only learning algorithms have recently gained attention as alternatives to gradient backpropagation, replacing the backward step of this latter solver with an additional contrastive forward pass. Among these approaches, the so-called Forward-Forward Algorithm (FFA) has been shown to achieve competitive levels of performance in terms of g...Votes: 0GitHub stars: 3
- Object Based Attention Through Internal Gating**arXiv ID:** 2106.04540 **Authors:** Jordan Lei, Ari S. Benjamin, Konrad P. Kording **Published:** 2021-06-08T17:20:50Z **Abstract:** Object-based attention is a key component of the visual system, relevant for perception, learning, and memory. Neurons tuned to features of attended objects tend to be more active than those associated with non-attended objects. There is a rich set of models of this phenomenon in computational neuroscience. However, there is currently a divide between models t...Votes: 0GitHub stars: 3
- Nonstructured Dnn Weight Pruning Is It Beneficial In Any Platform**arXiv ID:** 1907.02124 **Authors:** Xiaolong Ma, Sheng Lin, Shaokai Ye, Zhezhi He, Linfeng Zhang, Geng Yuan, Sia Huat Tan, Zhengang Li, Deliang Fan, Xuehai Qian, Xue Lin, Kaisheng Ma, Yanzhi Wang **Published:** 2019-07-03T20:27:51Z **Abstract:** Large deep neural network (DNN) models pose the key challenge to energy efficiency due to the significantly higher energy consumption of off-chip DRAM accesses than arithmetic or SRAM operations. It motivates the intensive research on model compress...Votes: 0GitHub stars: 3