LIVE PULSE
5.1 Anthropic CEO Amodei calls for slower AI development and shared safety rules — 11 src2.8 Agility Robotics unveils Digit 5 humanoid for warehouses and factories — 2 src2.6 Apple ships rebuilt Siri with Google Gemini, but not in the EU — 2 src2.3 Siri AI in macOS 27 Golden Gate: FAQ, Germany availability, privacy questions — 2 src1.8 Sam Altman says OpenAI will not go public in 2026, citing AI safety concerns — 5 src1.4 OpenAI contractors review real ChatGPT conversations to rate responses, report says — 2 src1.4 Anthropic data retention policy prompts firms to limit Claude use for sensitive work — 1 src1.4 Fine-Tuning Vision-Language Models with Listener Gaze for Referring Expressions — 1 src1.4 Perceptual Reality Transformer Explores What Illustrations Must Preserve — 1 src1.4 Study Analyzes Self-Reported Limitations in NLP Research — 1 src5.1 Anthropic CEO Amodei calls for slower AI development and shared safety rules — 11 src2.8 Agility Robotics unveils Digit 5 humanoid for warehouses and factories — 2 src2.6 Apple ships rebuilt Siri with Google Gemini, but not in the EU — 2 src2.3 Siri AI in macOS 27 Golden Gate: FAQ, Germany availability, privacy questions — 2 src1.8 Sam Altman says OpenAI will not go public in 2026, citing AI safety concerns — 5 src1.4 OpenAI contractors review real ChatGPT conversations to rate responses, report says — 2 src1.4 Anthropic data retention policy prompts firms to limit Claude use for sensitive work — 1 src1.4 Fine-Tuning Vision-Language Models with Listener Gaze for Referring Expressions — 1 src1.4 Perceptual Reality Transformer Explores What Illustrations Must Preserve — 1 src1.4 Study Analyzes Self-Reported Limitations in NLP Research — 1 src
HEATPULSEAI MAGAZINES
FLIP · FOLLOW · SAVE
Log inSign up

combinatorial optimization

topic6 events
papersTODAY 04:00 UTC

arXiv paper extends neural combinatorial optimization to population-based architectures

A revised arXiv preprint argues that neural combinatorial optimization has largely been limited to policies that work on a single candidate solution, whether by building one from scratch or refining it step by step. The authors propose shifting toward population-based architectures that evaluate and evolve multiple solutions together. The work appears in the cs.LG category as a replacement submission.

research/optimization/arxiv/neural-networks
papersTODAY 04:00 UTC

Unsupervised Graph Neural Network Method Targets Minimum Dominating Set

A new arXiv paper proposes an unsupervised graph neural network approach to the Minimum Dominating Set problem, an NP-hard combinatorial task. The method is aimed at applications such as influence maximization in social networks, viral marketing, and public health interventions. The work frames dominating set selection as a learning problem that does not require labeled optimal solutions.

graph-neural-networks/optimization/social-networks/research
papersTODAY 04:00 UTC

Eigenvalue-Decomposition Cost Denoising Offered as Alternative to Predict-then-Optimize

A new arXiv paper proposes cleaning up predicted edge costs via eigenvalue decomposition before solving shortest-path problems, rather than feeding raw predictions straight into the optimizer. The approach is positioned as a substitute for predict-then-optimize pipelines like SPO+, which learn a mapping from contextual features to unknown costs and then optimize on those predictions. The authors argue this denoising step can improve outcomes on combinatorial problems where prediction error propagates into the final solution.

optimization/arxiv/research/shortest-path
papersSEP 12 04:00 UTC

arXiv paper proposes automating QUBO formulation from natural language

A new arXiv preprint describes a method for generating Quadratic Unconstrained Binary Optimization formulations directly from natural language descriptions. QUBO is widely used in combinatorial optimization and works with quantum, hybrid quantum-classical, and quantum-inspired solvers. The work aims to remove the manual effort of translating problem statements into QUBO form.

quantum/optimization/research/nlp
papersSEP 12 04:00 UTC

Formal Abstractions Boost Combinatorial Optimization in Resource-Limited Language Models

A new arXiv paper proposes using formal abstractions to help language models solve combinatorial scheduling problems, where feasible answers must be found inside enormous search spaces under complex constraints. The authors focus on resource-constrained models, where limited compute makes such tasks especially difficult. The approach aims to raise accuracy without requiring larger models.

arxiv/combinatorial-optimization/reasoning/efficiency
papersSEP 10 04:00 UTC

arXiv paper proposes iteratively reweighted least squares for fixed-charge network flow

A new arXiv study, cross-listed in AI and machine learning, tackles the fixed-charge network flow problem, where continuous flow decisions are intertwined with binary choices about which arcs to activate. The authors introduce a method based on iteratively reweighted least squares to discover the support of active arcs, addressing a computationally hard model that underpins many network design and resource allocation tasks. The work offers an alternative optimization perspective on a classic combinatorial challenge.

optimization/machine-learning/network-design