Skip to content
View paulchris7's full-sized avatar

Block or report paulchris7

Block user

Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users.

You must be logged in to block users.

Content in all repositories owned by your account will be closed.
Maximum 250 characters. Please don’t include any personal information such as legal names or email addresses. This note will only be visible to you.
Report abuse

Contact GitHub support about this user’s behavior. Learn more about reporting abuse.

Report abuse
paulchris7/README.md

Hi, I'm Chris

AI/ML & Aspiring Systems Researcher | Dynamical Systems · Time Series · Low-Level Systems | Seeking a 2027 Research Internship

I am a final-year Computer Engineering student (M.Eng.) at ENSA Marrakech, Cadi Ayyad University. My work sits between two worlds: low-level systems engineering (C/C++, memory, compilers) and machine learning for signals and dynamical systems. I study how learning systems recover the laws behind a signal, and when they fail.

I enjoy digging into how software works under the hood, from web backends to compiler internals, and I like measuring things carefully before claiming anything about them.

ORCID LinkedIn Email


Research Preprints

All papers and posters are open access on Zenodo (CC BY 4.0), each with code, data and figures on GitHub.

Learning and Discovering Chaotic Dynamics from Sparse, Noisy Observations

DOI Code

Can data-driven methods recover the equations of chaotic systems from short, sparse, noisy records? Dense least squares, SINDy, weak-form SINDy, a black-box neural ODE and a sparse-library neural ODE are compared on Lorenz-63 and a four-species Lotka–Volterra model. At about 4 samples per oscillation and 1% noise, the sparse neural ODE recovers the Lorenz equations with a median coefficient error of 0.05, where all derivative-based and weak-form estimators fail.

  • Focus: System Identification, Neural ODEs, Multiple Shooting, Uncertainty Quantification.

From Simulated Falls to Freezing of Gait: A Controlled Study of Domain Shift in Wearable Accelerometry

DOI Code

A fall detector trained on healthy volunteers (SisFall) is applied, with no patient labels, to freezing of gait in Parkinson's patients (Daphnet). A CNN-1D, LSTM, GRU and patch Transformer are compared under identical protocols: in-domain AUROC of 0.988–0.999 collapses to 0.49–0.63 under zero-shot transfer, and a training-free freeze index beats every network.

  • Focus: Domain Shift, Time-Series Deep Learning, Wearable Sensing, Evaluation Methodology.

How Much Does the Algorithm Matter? The Maximum Subarray Problem, from O(n³) to O(n)

DOI Code

A controlled empirical study of five 1D and five 2D algorithms in C++: 740,091 correctness checks with zero failures, exact operation counts in 140 of 140 cases, and fitted exponents of 2.95, 2.01, 1.08 and 1.000. Kadane's algorithm is about 300× faster than the quadratic method at n = 2¹⁰, and in 2D the choice of compression side changes the running time by up to 2,741×.

  • Focus: Asymptotic Analysis, Benchmarking, Measurement Design, C++.

Research Interests

  • Dynamical Systems & Time Series: System identification, neural ODEs, sparse regression, forecasting under noise.
  • Robustness & Generalization: Domain shift, transfer to unseen populations, honest evaluation protocols.
  • Systems Programming: Low-level development, C/C++, memory management, performance.
  • Algorithmic Theory: Optimization, complexity analysis, empirical algorithmics.
  • Compiler Basics: Exploring how code is analyzed and transformed (GCC/GIMPLE).

Tech Stack

Languages

C++ C Python SQL LaTeX

Machine Learning & Scientific Computing

PyTorch NumPy SciPy scikit-learn Pandas Jupyter Colab

Tools & Frameworks

GCC Z3 Git Linux CMake Qt Node.js


Connect

ORCID LinkedIn Email

Pinned Loading

  1. max-subarray-complexity max-subarray-complexity Public

    Controlled empirical study of the maximum subarray problem, from O(n³) to O(n), in 1D and 2D. Five 1D and five 2D algorithms in C++, 740,091 correctness checks, bootstrap-timed benchmarks. Preprint…

    TeX

  2. Haitian-Scrabble-Game Haitian-Scrabble-Game Public

    This is a C++ implementation of the popular word game Scrabble, with a twist—it's tailored for the Haitian Creole language.

    C++

  3. parkinson-domain-shift parkinson-domain-shift Public

    Controlled study of domain shift in wearable accelerometry: CNN, LSTM, GRU and Transformer fall detectors trained on SisFall, evaluated zero-shot on Parkinsonian freezing of gait (Daphnet). Code + …

    Jupyter Notebook

  4. sparse-chaos-discovery sparse-chaos-discovery Public

    Learning chaotic dynamics from sparse, noisy data: sparse-library neural ODEs vs SINDy / weak SINDy on Lorenz-63 and Lotka–Volterra. Equation recovery, Lyapunov-time forecasting, loss landscapes, U…

    Jupyter Notebook