·
DataBubble
  • Home
  • Models
  • News
  • Compare
  • Boards
  • Pricing
  • About
  • Newsletter
  • Methodology
  • Contact
Latest
Cursor makes its biggest India push yet ahead of SpaceX acquisition with localized pricing4h◆Photonic reservoir computing with complex networks4h◆XS-VLA: Coupling Coarse-grained Spatial Distillation with Latent Flow Matching for Lightweight Robotic Control4h◆Agentic Permissions Policy Algebra for Taint Confinement in LLM Agents4h◆Beyond Squared Error: Exploring Loss Design for Enhanced Training of Generative Flow Networks4h◆The One-Word Census: Answer-Choice Conformity Across 44 Language Models4h◆Creative Integration: A Decidable Criterion of Creativity4h◆BERT-based Models vs. Large Language Models for Low-Resource Named Entity Recognition: A Comparative Study on Marathi4h◆Joint Optimization for Greedy Longest-match Tokenization4h◆Kimi K3: Open Frontier Intelligence4h◆The Few-shot Dilemma: Over-prompting Large Language Models4h◆Speculative Pipeline Decoding: Higher-Accuracy Drafting with Hidden Latency via Pipeline Parallelism4h◆Bayesian Complete-Pooling in Cross-Subject Classification for Motor Imagery Electroencephalogram4h◆StageGuard: Physiologically Constrained Sleep Staging4h◆Soft-Constrained Optimization of Latent Space in Variational Autoencoders4h◆Beyond Error-vs-Discard Characteristic: Toward Stable and Reliable Evaluation for Face Image Quality Assessment4h◆Analyzing the Importance of Blank for CTC-Based Knowledge Distillation4h◆Predicting Channel Closures in the Lightning Network with Machine Learning4h◆Evaluation of Blood Vessel Segmentation Methods on Hard-to-Detect Vascular Structures4h◆MOCA: A Transformer-based Modular Causal Inference Framework with One-way Cross-attention and Cutting Feedback4h◆Cursor makes its biggest India push yet ahead of SpaceX acquisition with localized pricing4h◆Photonic reservoir computing with complex networks4h◆XS-VLA: Coupling Coarse-grained Spatial Distillation with Latent Flow Matching for Lightweight Robotic Control4h◆Agentic Permissions Policy Algebra for Taint Confinement in LLM Agents4h◆Beyond Squared Error: Exploring Loss Design for Enhanced Training of Generative Flow Networks4h◆The One-Word Census: Answer-Choice Conformity Across 44 Language Models4h◆Creative Integration: A Decidable Criterion of Creativity4h◆BERT-based Models vs. Large Language Models for Low-Resource Named Entity Recognition: A Comparative Study on Marathi4h◆Joint Optimization for Greedy Longest-match Tokenization4h◆Kimi K3: Open Frontier Intelligence4h◆The Few-shot Dilemma: Over-prompting Large Language Models4h◆Speculative Pipeline Decoding: Higher-Accuracy Drafting with Hidden Latency via Pipeline Parallelism4h◆Bayesian Complete-Pooling in Cross-Subject Classification for Motor Imagery Electroencephalogram4h◆StageGuard: Physiologically Constrained Sleep Staging4h◆Soft-Constrained Optimization of Latent Space in Variational Autoencoders4h◆Beyond Error-vs-Discard Characteristic: Toward Stable and Reliable Evaluation for Face Image Quality Assessment4h◆Analyzing the Importance of Blank for CTC-Based Knowledge Distillation4h◆Predicting Channel Closures in the Lightning Network with Machine Learning4h◆Evaluation of Blood Vessel Segmentation Methods on Hard-to-Detect Vascular Structures4h◆MOCA: A Transformer-based Modular Causal Inference Framework with One-way Cross-attention and Cutting Feedback4h◆
Tag

#evolutionary-computing

4 articles tagged #evolutionary-computing

arxivJul 10

($\theta_l, \theta_u$)-Parametric Multi-Task Optimization: Joint Search in Solution and Infinite Task Spaces

arXiv:2503.08394v5 Announce Type: replace-cross Abstract: Multi-task optimization is typically characterized by a fixed and finite set of tasks. The present paper relaxes this condition by considering a non-fixed and potentially infinite set of optimization tasks defined in a parameterized, continuo

#optimization#machine-learning#evolutionary-computingRead on arxiv →
arxivJun 1bullish

Evolutionary Algorithm for Reservoir Learning and Yielding

arXiv:2605.30372v1 Announce Type: cross Abstract: Reservoir computing, a type of recurrent neural network, is a promising approach for temporal learning as it separates dynamic processing from the trained readout layer. However, classical Echo State Networks (ESNs) often require task-specific tuning

ECEA2 models#neural-networks#evolutionary-computing#temporal-learningRead on arxiv →
arxivMay 29

Evolving Features vs Evolving Entire Trees with GP for Interpretable Survival Analysis

arXiv:2605.30119v1 Announce Type: cross Abstract: Survival analysis concerns the task of predicting the time until an event occurs. Often used in the medical field, survival analysis deals with incomplete (i.e., censored) data, for instance, from patients who did not experience the event during the

#machine-learning#survival-analysis#evolutionary-computingRead on arxiv →
arxivApr 10

Introducing Echo Networks for Computational Neuroevolution

arXiv:2604.08204v1 Announce Type: new Abstract: For applications on the extreme edge, minimal networks of only a few dozen artificial neurons for event detection and classification in discrete time signals would be highly desirable. Feed-forward networks, RNNs, and CNNs evolved through evolutionary

ECNERN4 models · +1#machine-learning#neural-networks#evolutionary-computingRead on arxiv →
HomeModelsNews