A ride can look perfectly normal. The driver accepts a request, reaches the pickup point, and ends the trip shortly afterward. Nothing in that single transaction necessarily screams fraud. But place it beside the driver’s repeated early completions, the passengers who frequently disappear from the platform after pickup, and the same locations where similar cancellations occur, and the pattern changes. ...
Customer networks are messy. Product graphs are messy. Fraud rings are messy. Supply-chain graphs are messy. The usual engineering reflex is also messy: when the graph model disappoints, add another architecture, another positional encoding, another “graph-aware” module, another clever acronym to the pile. The paper Semantic Refinement with LLMs for Graph Representations suggests a quieter alternative: before changing the model, change what the model is asked to read.1 ...
The problem is not that RL cannot plan. It is that it keeps learning the wrong object. A warehouse robot can learn to pick up box A from shelf B and move it to station C. Very impressive, until tomorrow’s warehouse has different boxes, different shelves, and a new station name. The action label changed. The task structure did not. ...
Benchmarks Are Where Models Stop Being Inspirational Benchmarks are not glamorous. They are where models go after the demo video, after the conference slide, and after the sentence “this generalizes beautifully” has done its little dance in front of investors. Graph learning badly needs that room. For years, graph machine learning has been evaluated on comfortable territory: molecular graphs, citation networks, small academic datasets, and carefully packaged tasks that are useful but narrow. That helped the field grow. It also created a quiet distortion. A model could look impressive while never having to deal with a social network that changes over time, a circuit whose tiny structural error destroys correctness, a SAT instance where solver choice matters, or a weather graph where the planet is inconveniently spherical. ...
A fraud model does not only learn from transactions. It learns from sequence. Who interacted with whom. When. How often. After what previous event. Before which next event. In temporal graph systems, the order is not metadata. It is the thing being modelled. That is why LoReTTA is an uncomfortable paper.1 It does not argue that Temporal Graph Neural Networks can be broken only by a powerful adversary with model access, expensive surrogate training, and a theatrical pile of fake edges. It argues something more operationally annoying: a continuous-time graph can be poisoned by removing influential interactions and replacing them with plausible ones. The resulting history still looks enough like history. The model quietly learns the wrong temporal structure. Very civilised, as crimes go. ...
A traffic light is not just a traffic light once the other lights start learning. That is the uncomfortable starting point for strategic AI systems. A single model can optimise a route, price, recommendation, allocation, or control policy. But the moment other decision-makers are learning at the same time, the environment stops behaving like scenery. It becomes a cast. Each actor updates, reacts, misreads, cooperates, defects, imitates, or quietly ruins the assumptions in your simulator. Very rude, but entirely realistic. ...
TL;DR for operators A recent arXiv paper proposes IVGAE-TAMA-BO, a dynamic graph model for predicting whether future crop-trade links are likely to exist in the global food network.1 That sounds grand. The useful version is narrower and better: the model tries to learn how trade relationships rewire over time, especially when old routes persist, weak links disappear, and new pairings emerge. ...
TL;DR for operators A user asks an AI agent to delete an account. The obvious tool is DeleteAccount. A normal semantic retriever will probably find it. Splendid. The agent still fails if it misses GetUserToken, because the deletion tool needs a token first. This is the failure mode Tool Graph Retriever, or TGR, is built to address.1 ...
TL;DR for operators GraphEXT is not another attempt to colour a few nodes and declare the model “interpretable”. It makes a sharper claim: in graph neural networks, a node’s importance is partly created by the structure around it. The same node may matter differently when its neighbours, subgraphs, and coalition boundaries change. ...
TL;DR for operators PyG 2.0 is not mainly a “new GNN model” story. It is an infrastructure story. The paper presents PyTorch Geometric as a modular graph-learning stack that now covers storage, sampling, heterogeneous and temporal graph handling, neural message passing, acceleration, explainability, and application workflows such as relational deep learning and GraphRAG.1 ...