Page 55 of 146

AllHigh signalRecent
5830 articles
Reddit r/LocalLLaMA·

I built an enforcement layer for AI coding agents using a local knowledge graph and hybrid RAG

Writ is an enforcement layer for AI coding agents using a local Neo4j knowledge graph and hybrid RAG. A 5-stage retrieval pipeline (BM25, HNSW vector similarity, graph traversal, reciprocal rank fusion) surfaces only relevant rules per task. 30 bash hook scripts enforce execution: no code without approved plan, mandatory tests, static analysis required.

AI AgentsCode generationRAG
SIG
72
HYP
25
Reddit r/MachineLearning·

Kept context-switching between arxiv, OpenReview, GitHub, and HuggingFace for every paper, so I built this. Chrome extension + website with everything inline, plus citation graph + SPECTER2 neighbors. 3M papers, free, feedback welcome [P]

Tomesphere: Chrome extension + website indexing 3M arxiv papers with LLM-curated summaries, OpenReview reviews, GitHub repos, HuggingFace models, citation graphs and SPECTER2 semantic neighbors. Free, no signup.

PapersToolsOpen source
SIG
72
HYP
35
arXiv cs.LG·

Balancing Fidelity and Diversity in Diffusion Models via Symmetric Attention Decomposition: Hopfield Perspective

Theoretical paper decomposing the pre-softmax attention matrix QK^T into symmetric and skew-symmetric components. The symmetric part governs the energy landscape, the skew-symmetric part drives circulation. Authors propose Hopfield-style stability measures to quantify fidelity-diversity trade-offs in generation and a controllable mechanism to modulate this trade-off.

ReasoningPapersVision
SIG
72
HYP
15
arXiv cs.LG·

Detect by Yourself: Self-Designing Agentic Workflows for Few-Shot Graph Anomaly Detection

SignGAD introduces a self-designing agentic framework for few-shot graph anomaly detection. Instead of fixed pipelines, it designs task-conditioned detection workflows by selecting suitable graph encodings and detector designs. A guarded refit strategy refines selected workflows under limited supervision, outperforming state-of-the-art methods on real-world datasets.

AI AgentsBenchmarksPapers
SIG
72
HYP
28
arXiv cs.LG·

Comparative Analysis of Liquid Neural Networks and LSTM for Sequential Pattern Recognition: Robustness, Efficiency, and Clinical Utility

Comparative study of Liquid Neural Networks (LNN/CfC) vs LSTM across four sequential modalities (N-MNIST, QuickDraw, IAM, PhysioNet Sepsis-3). LNNs model hidden state evolution as continuous differential equations. Results: LNNs outperform LSTM in parameter efficiency and robustness to missing data, especially in clinical environments.

BenchmarksReasoning
SIG
72
HYP
18
arXiv cs.LG·

$E^3$-Agent: An Executable and Evolving Agent for Resource Management of Edge Generative Inference

E³-Agent is an executable and evolving agent for edge generative inference resource management. It pairs a fast-path router (millisecond dispatch) with a slow-path LLM meta-controller driven by events, learning online from execution feedback. Evaluated in simulation, it reduces latency by 65-73% versus static baselines across dynamic scenarios (semantic shifts, device churn, hidden drift).

AI AgentsReasoningInfrastructure
SIG
72
HYP
28
arXiv cs.LG·

Metric-Aware PCA as a Linear Instance of Geometric Deep Learning

Theoretical paper positioning Metric-Aware Principal Component Analysis (MAPCA) within geometric deep learning framework. MAPCA parameterises PCA by a positive-definite metric matrix, with solutions equivariant under the orthogonal group preserving the metric. A uniqueness theorem characterises Invariant PCA as the unique linear data-derived metric equivariant under arbitrary diagonal rescaling.

PapersReasoning
SIG
72
HYP
15
arXiv cs.AI·

Hierarchical Prompt-Domain Control and Learning for Resource-Constrained Agentic Language Models

Hierarchical framework for compact LLMs in resource-constrained agentic systems. Model distillation + oracle-controller loop monitors protocol validity, projects histories into feasible prompt domain, triggers lightweight fine-tuning under drift. Separates schema learning from semantic adaptation. Evaluated on Multi-Fidelity Bayesian Optimization with improved reliability and cost-efficiency.

AI AgentsFine-tuningPrompt engineering
SIG
72
HYP
18
arXiv cs.LG·

Supervised Distributional Reduction via Optimal Transport and Dependence Maximization

SDR (Supervised Distributional Reduction) combines optimal transport and dependence maximization to learn target-aware representations. The algorithm extends the Fused Gromov-Wasserstein objective with an explicit dependence term, producing compact embeddings that capture both geometric structure and predictive signal. Application to Gaussian Process modelling with adaptive kernels.

Papers
SIG
72
HYP
15