Graph embedding, the task the model targets, sits at the heart of many modern data applications. Social networks, citation networks, knowledge graphs, protein interaction networks and recommendation systems all share a common mathematical structure: entities are nodes, relationships are edges, and nodes often carry rich attribute information such as text or numerical features. Graph embedding compresses this high-dimensional, sparse structure into compact low-dimensional vectors that downstream algorithms can consume. The quality of those vectors determines how well a system can predict missing links, classify nodes into categories, or cluster similar entities together. As graphs grow to millions of nodes, the efficiency of the embedding method becomes as important as its accuracy.

The dominant tools for this job are Graph Autoencoders, known as GAEs, which combine graph convolution operations with an encoder-decoder framework. Graph convolutions allow each node to aggregate information from its neighbors, weaving structural and attribute information into a single representation. But these models are trained with gradient descent, an iterative optimization procedure in which parameters are nudged repeatedly in the direction that reduces reconstruction error. The authors of the new study point out two persistent problems with this approach: convergence can be slow, particularly on large graphs, and the optimization landscape is riddled with local optima, meaning the model can settle into a mediocre solution that it cannot escape. Both issues translate into wasted computation and unpredictable quality.

RCGELM-AE takes a fundamentally different route by building on the Extreme Learning Machine Autoencoder, or ELM-AE, a family of models in which the input-to-hidden weights are randomly assigned and fixed, and the output weights are solved in closed form using linear algebra rather than iterative optimization. Because the hidden layer parameters never need to be tuned, training reduces to a single matrix computation, which is fast, stable and immune to the local optima that plague gradient descent. The generalized variant, GELM-AE, extends this idea with a regularization term that improves generalization. What plain GELM-AE lacks, however, is any notion of graph topology. It treats each node as an independent data point, blind to the edges that define the network. The new model closes that gap with two carefully engineered components.

The first component embeds graph convolution operations directly between the input and hidden layers of the autoencoder. In practical terms, before the random projection takes place, each node’s features are smoothed over its local neighborhood, so the representation that enters the hidden layer already carries information about who a node is connected to. This single, strategically placed convolution compensates for the inherent inability of GELM-AE to capture topological information, allowing the model to integrate structure and attributes in one pass without the deep stacks of propagation layers used in conventional graph neural networks.

The second component is a residual compensation mechanism, an idea inspired by the residual learning revolution in computer vision. Instead of stacking many graph propagation layers to extract deeper features, which is known to cause over-smoothing, a pathology in which node representations become indistinguishable as information is averaged over and over, RCGELM-AE feeds the reconstruction errors of the encoder back into the pipeline. These errors, the parts of the input the first encoding pass failed to capture, are treated as a new signal and encoded again, extracting deeper-level features layer by layer. Each compensation stage therefore adds representational depth without adding repeated graph smoothing, sidestepping the over-smoothing risk that limits the depth of conventional deep graph models while boosting the model’s expressive power.

The empirical results reported in the study are substantial. On link prediction tasks, where the goal is to infer missing or future connections between nodes, the model improved the area under the receiver operating characteristic curve, AUC, by 4.11 to 8.93 percent and average precision, AP, by 4.01 to 10.01 percent relative to the baselines. On node classification tasks, where each node must be assigned to a category, the F1-micro and F1-macro scores rose by 0.42 to 4.97 percent and 0.48 to 5.27 percent respectively. Crucially, these gains came with a notable reduction in running time, because the closed-form learning scheme replaces hundreds or thousands of gradient updates with a single solve.

The scalability evidence is perhaps the most compelling part of the study. The authors evaluated RCGELM-AE on two large benchmark graphs from the Open Graph Benchmark, ogbn-arxiv and ogbl-ppa, which contain substantially more nodes and edges than the datasets used in the main experiments. Running on a 24 GB NVIDIA GeForce RTX 3090 GPU, the model achieved the best AUC and AP scores on both datasets against representative gradient-trained baselines including GAE, VGAE, LGAE and DGNN. The total training times were remarkable: just 2.12 seconds on ogbn-arxiv and 9.53 seconds on ogbl-ppa. The baselines, by contrast, require repeated epoch-wise optimization, with each epoch costing a full pass of forward and backward computation. For iterative models the reported figure is only the average time per epoch, meaning their total cost is orders of magnitude higher.

The implications extend beyond raw speed. Gradient-free training eliminates a whole class of engineering headaches: learning-rate schedules, initialization sensitivity, early-stopping heuristics and the variance introduced by stochastic mini-batching all become irrelevant when the solution is computed analytically. That stability is attractive for applications where reliability matters, such as fraud detection on financial networks, drug discovery on molecular graphs, or knowledge graph completion in large-scale information systems. It also lowers the barrier for researchers and organizations without access to extensive GPU clusters, since a model that trains in seconds on a single consumer graphics card democratizes access to state-of-the-art graph learning.

The work, led by Xinyi Lin, Xiaoyun Chen, Shulan Zheng and Wenjian Chen of the College of Mathematics and Statistics at Fuzhou University, and supported by the Natural Science Foundation of Fujian Province, does not claim that gradient descent is obsolete. Random projection methods have their own trade-offs, and the fixed random layer must be wide enough to capture the relevant feature space. But the study makes a persuasive case that the deep learning community’s default assumption, that competitive graph representations require iterative optimization, deserves scrutiny. As graphs in science, commerce and social media continue to swell toward planetary scale, a framework that delivers better accuracy in a fraction of the time may prove less a curiosity and more a glimpse of where efficient machine learning is headed.

Subject of Research: A gradient-descent-free graph embedding autoencoder combining graph convolution and residual compensation for efficient link prediction and node classification

Article Title: RCGELM-AE: an efficient graph embedding deep model without gradient descent

Article References: Lin, X., Chen, X., Zheng, S., & Chen, W. (2026). RCGELM-AE: an efficient graph embedding deep model without gradient descent. Applied Intelligence, 56(14), Article 404. https://doi.org/10.1007/s10489-026-07437-1

Image Credits: AI Generated

DOI: 10.1007/s10489-026-07437-1

Keywords: graph embedding, extreme learning machine, autoencoder, gradient descent, graph convolutional networks, link prediction, node classification, residual compensation, over-smoothing, Open Graph Benchmark, deep learning, Applied Intelligence

The core problem the team set out to solve is one that anyone who has fabricated a microchip will recognize. Photonic neural networks promise enormous gains in speed and energy efficiency because light can perform massive numbers of multiply-and-accumulate operations in parallel, at the speed of propagation and with almost no heat dissipation. But before such a chip can do useful work, its tunable elements — phase shifters, couplers, and other adjustable components — must be set to precise values. Traditionally, those values are found by training a digital twin of the circuit in software. That twin is built from physical models of the device, and no model is perfect. Tiny discrepancies between the simulated chip and the fabricated one, introduced by manufacturing tolerances, thermal drift, and unmodeled nonlinearities, accumulate through the layers of a network and can destroy its accuracy. Re-modeling every chip individually is computationally expensive and often impractical at scale.

INSPIRE sidesteps the digital twin entirely. The method works by measuring, on the chip itself, the full complex optical fields of the bidirectional modes that propagate through the circuit — that is, both the amplitude and the phase of the light traveling forward and backward through the device. The key enabling technology is what the authors call on-chip synthetic time-reversal holography. Holography is a well-established technique for recording complete wavefronts, including phase information that ordinary intensity detectors miss. By synthesizing a time-reversed counterpart of the light field on the chip, the system can effectively send light backward through the circuit and interfere it with reference beams, extracting the field information needed to compute gradients. Those gradients — the same mathematical objects that drive learning in conventional deep networks — are then used to update the chip’s tunable parameters directly, so the physical system and the learning algorithm are one and the same process.

What makes the approach especially powerful is its generality. Earlier demonstrations of in situ training in photonics were often tailored to a specific architecture, such as a particular mesh of interferometers or a diffractive stack. INSPIRE, by contrast, is topology-agnostic: it does not care how the optical circuit is wired together. As long as the device has tunable elements and the bidirectional fields can be measured, the method applies. That compatibility with diverse optical circuits — from integrated interferometer meshes to metasurface-based processors — is what the authors mean by calling it a generalized training framework, and it is what separates this work from the growing but fragmented family of physical training techniques that have appeared in recent years.

The experimental results are striking. In benchmark demonstrations, the team trained matrices directly on the photonic hardware and achieved a relative error of just 0.26 percent against the target values — a level of precision that indicates the physical gradient computation is not merely a rough approximation but a faithful replacement for software-based optimization. Perhaps more surprising is what the researchers achieved when they pushed the method through a scattering medium, a chaotic optical environment that scrambles light in ways that are notoriously difficult to model. Using INSPIRE, they trained matrices larger than the number of native tunable elements on the chip, effectively extracting more computational capacity from the hardware than its component count would suggest possible. Because the training happens in situ, the scattering and imperfections of the medium become part of the computation rather than obstacles to it.

The team then extended the framework into the realm of meta-learning — the science of teaching systems how to learn quickly. Meta-photonic circuits trained with INSPIRE were able to perform in situ meta-learning, adapting to new tasks with remarkable efficiency. The reported numbers are eye-catching: a 251-fold compression of the model and a 136-fold acceleration in task-specific training compared with conventional approaches. In practical terms, this means a single photonic circuit can be prepared so that it snaps to a new task after minimal additional training, a property known as single-shot photonic learning. For applications where a device must be reconfigured on the fly — a sensor that changes environment, a camera that switches between imaging modes — that kind of rapid adaptability could be transformative.

The broader context explains why this demonstration has generated excitement well beyond the photonics community. Deep learning’s explosive growth has collided with the slowing of Moore’s law, and the energy cost of training and running large models on digital hardware has become a first-order concern for the industry. Optical computing has long been proposed as an escape route, and laboratory demonstrations have shown photonic processors performing inference with extraordinary efficiency — some operating with less than one photon per multiplication. But the training bottleneck has persisted: if every chip must be modeled and calibrated in software, the promise of cheap, mass-producible optical AI hardware remains out of reach. A training method that lives on the chip itself, that is indifferent to the circuit’s design, and that absorbs fabrication errors into the learning process, addresses that bottleneck head-on.

INSPIRE also fits into a rapidly evolving landscape of physical training research. Recent years have seen in situ backpropagation demonstrated in photonic meshes, forward-only training schemes that avoid sending signals backward through hardware, and theoretical frameworks for training physical neural networks of many kinds. Each of these advances has chipped away at the problem, but most have carried architectural constraints or required specialized hardware modifications. The holographic field-measurement approach at the heart of INSPIRE is notable because it treats the optical circuit as a black box whose bidirectional response can be interrogated, making the training procedure a property of the measurement scheme rather than of the device design. The authors have also released the software code for the model and training procedure through Zenodo, which should make it easier for other groups to adopt and extend the method.

There are, of course, questions that future work must answer. The demonstrations reported here, while impressive, were carried out on laboratory-scale systems, and scaling to the very large networks that commercial applications would demand will require careful engineering of the holographic measurement apparatus and the on-chip tunable elements. The speed at which gradients can be measured and applied, the stability of the trained parameters over time and temperature, and the integration of the training hardware alongside the computing hardware on a single chip are all open engineering challenges. The energy accounting of the full training pipeline, including the lasers and detectors involved in the holographic measurements, will also need to be quantified as the technology matures.

Even so, the trajectory is clear. A photonic chip that can measure its own internal light fields, compute its own gradients, and update its own parameters represents a meaningful step toward adaptive, self-configuring optical processors. If the approach scales, the consequences could reach far beyond data centers: smart sensors that learn their environment at the point of capture, imaging systems that retrain themselves in microseconds, and AI hardware whose energy footprint is measured in milliwatts rather than megawatts. The authors describe their work as a practical route toward adaptive and efficient intelligent photonic systems, and with error rates below one percent and training that survives scattering media, that route now looks considerably more navigable than it did before.

Subject of Research: In situ physical gradient descent training of photonic neuromorphic integrated circuits

Article Title: Photonic neuromorphic learning via generalized in situ physical gradient descent

Article References: Zhou, T., Zhao, Y., Li, S., Shao, G., Huang, R., & Fang, L. (2026). Photonic neuromorphic learning via generalized in situ physical gradient descent. Nature Computational Science. https://doi.org/10.1038/s43588-026-01057-y

Image Credits: AI Generated

DOI: 10.1038/s43588-026-01057-y

Keywords: photonics, neuromorphic computing, in situ training, gradient descent, holography, optical neural networks, meta-learning, photonic integrated circuits, energy-efficient computing, scattering media, inverse design, Nature Computational Science

John George Francis and Anil Shaji focused on transmon qubits, the workhorse of IBM’s quantum processors and many other superconducting platforms. Transmons are engineered from Josephson junctions and superconducting circuits to be relatively insensitive to charge noise, a design choice that has made them the most widely deployed qubit technology in the world. Yet even the best-fabricated transmons deviate from the idealized textbook description. Stray couplings, higher energy levels, and control imperfections all conspire to make the actual dynamics of the system richer and messier than the standard Hamiltonian predicts.

The team targeted one of the most important operations in the superconducting quantum computing repertoire: the cross-resonance gate. In this scheme, microwaves are applied to a target qubit at the frequency of its control qubit neighbor, creating an entangling interaction that serves as a fundamental building block for two-qubit logic. The cross-resonance interaction has a well-known effective Hamiltonian description, developed in earlier theoretical work, but that description is itself an approximation whose accuracy depends on the details of the hardware and the drive parameters. When the idealized model is used to predict what a real gate does, errors accumulate quickly.

To quantify those errors and correct them, Francis and Shaji turned to real experimental data from ibm_kyiv, one of the processors accessible on the IBM Quantum cloud platform. They collected measurement outcomes for two transmon qubits driven by microwave pulses of varying amplitudes and evolution times, spanning a range of operating conditions. Each data point captured the probabilities of the different computational basis states after the system evolved under the cross-resonance drive, providing a rich empirical fingerprint of the true dynamics that no purely theoretical model could be expected to reproduce exactly.

The heart of their method is a correction operator added to the standard Hamiltonian. Rather than guessing the correction from first principles, the researchers wrote down an ansatz, a flexible mathematical form whose matrix elements are free parameters to be optimized. The goal of the optimization is simple to state and hard to achieve: find the correction terms that make the corrected Hamiltonian’s predicted evolution match the observed hardware data as closely as possible across all the measured amplitudes and times. Because the ansatz is not unique, different parameter choices can yield equally good fits, so the team developed methods to characterize an entire equivalence class of effective corrections rather than a single answer.

Optimizing parameters inside a differential equation is exactly the kind of problem that scientific machine learning was built to solve. The researchers employed adjoint sensitivity analysis, a technique that efficiently computes how the final outcome of a dynamical simulation changes with respect to every parameter in the model, without the prohibitive cost of naive approaches. Combined with gradient descent, this allowed the correction terms to be tuned iteratively until the simulated and measured probability distributions converged. The approach draws on the framework of universal differential equations, in which physical models are embedded in differentiable programs that machine learning tools can optimize end to end.

The results are striking. With the uncorrected Hamiltonian, the worst-case average absolute error in predicting the final measurement probabilities reached 0.48, meaning the theoretical model could be wrong by nearly half a full probability unit, a level of disagreement that would render any gate calibration based on the model unreliable. After the data-driven correction was applied, that worst-case error dropped below 0.05, an improvement of nearly a factor of ten. The corrected Hamiltonian tracked the survival probabilities of all four initial two-qubit states across the full range of pulse amplitudes tested, reproducing the fine structure of the hardware’s time evolution that the standard model missed entirely.

Why does this matter beyond one pair of qubits on one machine? Gate fidelities in today’s quantum processors are limited not only by decoherence but by systematic modeling errors, and as the field marches toward error-corrected, fault-tolerant machines, every fraction of a percent of gate accuracy counts. Accurate Hamiltonian models are also the foundation of optimal control techniques, which design pulse sequences to implement gates as faithfully as possible. If the underlying model is wrong, even the most sophisticated pulse optimization will steer the quantum system to the wrong destination. A data-driven correction loop, in which the model continuously learns from the hardware it describes, offers a path to calibrations that stay faithful as devices drift and age.

The work also highlights a broader shift in how quantum engineers think about the relationship between theory and experiment. Traditional approaches either derive effective Hamiltonians perturbatively from circuit theory or fit a handful of parameters to targeted experiments. The scientific machine learning approach is more ambitious: it treats the Hamiltonian itself as a learnable object, constrained by physics but refined by data, and it embraces the fact that multiple effective descriptions may be equally valid. That equivalence-class perspective is philosophically interesting, but it is also practically useful, because it tells engineers which features of a correction are physically meaningful and which are artifacts of a particular parameterization.

Francis and Shaji’s study, published in Quantum Information Processing, was supported in part by India’s National Quantum Mission and used the high-performance computing facilities at IISER Thiruvananthapuram. The underlying data have been made openly available, allowing other groups to test and extend the method on different hardware platforms. As quantum processors scale to hundreds and eventually thousands of qubits, manual calibration of every interaction will become impossible, and techniques like this one, which let the machine teach itself the physics of its own imperfections, may become as essential to quantum computing as the qubits themselves.

Subject of Research: Data-driven correction of the cross-resonance Hamiltonian of transmon qubits using scientific machine learning

Article Title: Data-driven Hamiltonian correction of transmon qubits

Article References: Francis, J. G., & Shaji, A. (2026). Data-driven Hamiltonian correction of transmon qubits. Quantum Information Processing, 25(10), Article 328. https://doi.org/10.1007/s11128-026-05350-7

Image Credits: AI Generated

DOI: 10.1007/s11128-026-05350-7

Keywords: transmon qubits, Hamiltonian correction, cross-resonance gate, scientific machine learning, IBM Quantum, quantum computing, gradient descent, adjoint sensitivity, quantum control, superconducting qubits, gate fidelity, quantum information processing