Archives AI News

ZeroSim: Zero-Shot Analog Circuit Evaluation with Unified Transformer Embeddings

arXiv:2511.07658v1 Announce Type: new Abstract: Although recent advancements in learning-based analog circuit design automation have tackled tasks such as topology generation, device sizing, and layout synthesis, efficient performance evaluation remains a major bottleneck. Traditional SPICE simulations are time-consuming, while existing…

Think-at-Hard: Selective Latent Iterations to Improve Reasoning Language Models

arXiv:2511.08577v1 Announce Type: cross Abstract: Improving reasoning capabilities of Large Language Models (LLMs), especially under parameter constraints, is crucial for real-world applications. Prior work proposes recurrent transformers, which allocate a fixed number of extra iterations per token to improve generation…

Cluster Catch Digraphs with the Nearest Neighbor Distance

arXiv:2501.06268v2 Announce Type: replace Abstract: We introduce a new method for clustering based on Cluster Catch Digraphs (CCDs). The new method addresses the limitations of RK-CCDs by employing a new variant of spatial randomness test that employs the nearest neighbor…

Outlyingness Scores with Cluster Catch Digraphs

arXiv:2501.05530v2 Announce Type: replace-cross Abstract: This paper introduces two novel, outlyingness scores (OSs) based on Cluster Catch Digraphs (CCDs): Outbound Outlyingness Score (OOS) and Inbound Outlyingness Score (IOS). These scores enhance the interpretability of outlier detection results. Both OSs employ…

Instance Generation for Meta-Black-Box Optimization through Latent Space Reverse Engineering

arXiv:2509.15810v2 Announce Type: replace Abstract: To relieve intensive human-expertise required to design optimization algorithms, recent Meta-Black-Box Optimization (MetaBBO) researches leverage generalization strength of meta-learning to train neural network-based algorithm design policies over a predefined training problem set, which automates the…

Autoencoding Dynamics: Topological Limitations and Capabilities

arXiv:2511.04807v2 Announce Type: replace Abstract: Given a “data manifold” $Msubset mathbb{R}^n$ and “latent space” $mathbb{R}^ell$, an autoencoder is a pair of continuous maps consisting of an “encoder” $Ecolon mathbb{R}^nto mathbb{R}^ell$ and “decoder” $Dcolon mathbb{R}^ellto mathbb{R}^n$ such that the “round trip”…