Research programme

Finding structure. Recovering evidence. Protecting meaning.

Three strands, developed across nine peer-reviewed works, connected by one question: how to reason reliably from data that resists being reasoned about.

Research, made visible

Finding the shape inside the noise

Measurements arrive with far more dimensions than the process behind them. Watch scattered samples settle onto the one-dimensional curve they actually came from, with neighbourhood links appearing as the geometry resolves.

Early along the curveLate along the curveNeighbourhood graph
Playing
01

Making manifold learning usable

Faster, cleaner, and more honest recovery of the shape hidden in high-dimensional data.

  • Isomap
  • A* search
  • Randomized KD-trees
  • Hessian LLE
  • Gaussian-process kernels

The problem

Real measurements arrive with far more dimensions than the process that generated them actually has. Isomap can recover that hidden low-dimensional shape, but it is slow on large datasets and a single bad neighbour link can fold the whole geometry in on itself.

The approach

Six connected papers attack the problem from different sides: a corrected neighbourhood graph, noise removal before the geometry is computed, A* search in place of exhaustive shortest paths, a divide-and-recombine scheme for scale, and Gaussian-process kernels for denoising that survives new data arriving.

Why it matters

Dimensionality reduction sits underneath visualization, clustering, and anomaly detection. When it distorts the geometry quietly, every conclusion drawn downstream inherits the distortion.

6 publications

02

Recovering data that was never recorded

Reconstructing missing traffic measurements from the structure that survives around them.

  • Tensor nuclear norm
  • Low-rank optimization
  • Nonlinear transforms
  • Proximal alternating minimization

The problem

Traffic sensors drop out — sometimes at random, sometimes in long correlated blocks when a whole corridor goes dark. Downstream forecasting treats the resulting gaps as if they were real, and degrades accordingly.

The approach

Treat the network as a tensor over location, direction, and time, and impose a compact multimode nonlinear transform on its nuclear norm, so that structure shared across all modes constrains the reconstruction. Recovery is driven by a convergent optimization strategy.

Why it matters

Signal timing, congestion pricing, and incident detection all consume this data directly. Gaps that go unrecovered become decisions made on evidence that is not there.

Publication

03

Learning without surrendering the data

Cryptography and federated methods applied to settings where the records cannot be pooled.

  • Federated learning
  • Quantum signcryption
  • Elliptic-curve cryptography
  • Privacy-preserving analytics

The problem

The datasets that would most repay analysis — clinical records above all — are the ones that cannot legally or ethically be centralized. Meanwhile the key management that protects them fails in known, specific ways.

The approach

Two strands. One examines where elliptic-curve cryptography holds and where it breaks in deployment. The other builds signcryption that addresses the key escrow and revocation problems directly, alongside federated approaches that move model updates instead of records.

Why it matters

Privacy-preserving analytics is what decides whether sensitive data gets used well or not at all. The guarantee has to be real, not procedural.

2 publications

Figures and algorithms

From the papers themselves.

Reproduced only where the licence allows it. Each figure carries its source, licence, and a link to the paper it came from. Select any figure to enlarge it.

Next

The full publication record.

Nine peer-reviewed works from 2020 to 2025, with citation counts and links to every version of record.

View publications