Search arXiv⌕ Search

arXiv · 2610.21391

NOCE-Net: Representation Learning for Battery Operational Context via Nested Sequence Modelling

Abstract

Learning effective representations from battery operational history is essential for predictive health management and control-oriented applications. Existing approaches rely on response-dependent engineered features or short early-life windows, limiting generalisability and precluding use in prospective settings where future responses are unavailable. We propose NOCE-Net, a deep nested sequence model that learns control-enabling representations directly from raw cyclic operational or telemetric data. Our data pipeline, re-BatteryData, standardises heterogeneous aging datasets into semantically equivalent Full Equivalent Cycles (FECs) defined by absolute charge throughput, enabling end-to-end learning across diverse operational regimes. NOCE-Net combines multi-patch transformer encoders for intra-cycle dynamics with a GRU backbone for inter-cycle state evolution, operating on approximately $700$ batteries across ten public datasets spanning over $300$ operational profiles. In zero-shot evaluation on unseen battery chemistries and usage patterns, NOCE-Net achieves $13.7\%$ MAPE in voltage response prediction, outperforming strong long-sequence baselines by over $43\%$ while using $40 \times$ fewer parameters. Shape and component diagnostics of the learned hidden states reveal that the GRU's principal direction of evolution achieves Spearman $|ρ| \geq 0.95$ with the capacity fade trajectory on average across all datasets with monotone degradation profiles, including zero-shot test batteries, providing evidence that the representations encode degradation dynamics transferable to downstream tasks beyond battery response modelling. Code is available at https://github.com/BeArnab96/NOCE-Net.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Arnab Bhattacharjee, Wayes Tushar, Tapan Kumar Saha. 2026-10-15. NOCE-Net: Representation Learning for Battery Operational Context via Nested Sequence Modelling. https://arxiv.org/abs/2610.21391

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

BioXArena: Benchmarking LLM Agents on Multi-Modal Biomedical Machine Learning Tasks

Large language model (LLM) agents increasingly automate machine-learning model building, yet biomedical benchmarks emphasize question answering, reasoning, and tool use or cover narrow slices of biomedical ML coding. We introduce BioXArena, a biomedical machine learning (BioML) coding benchmark for task-specific model building on heterogeneous, often multi-modal datasets. It contains 76 end-to-end tasks across 9 domains: sequence, single-cell, structure, network biology, chemical biology, perturbation dynamics, phenotype--disease, imaging, and text-integrated tasks. Each task packages primary-source data with hidden labels, held-out graders, and biology-aware metrics on a unified 0-to-100 scale; agents write runnable code, train models, and predict private test samples. BioXArena emphasizes realistic data interfaces: most tasks require agents to integrate multiple input sources, including 46 tasks that combine distinct modality families. We compare 18 harness--backbone configurations: general-purpose coding, biomedical, and ML agents plus our Minimal runner, all under the same controlled resource configuration. Codex with GPT-6 Astra achieves the highest task-level average score of 73.91 among 18 configurations, closely followed by Claude Code with Opus 5.5 (73.79). Matched-backbone comparisons show higher observed scores for mature coding systems than for Minimal; seven Minimal backends characterize model differences under a fixed runner. Beyond the main leaderboard, ablations, robustness checks, and scaling, runtime, and failure-mode analyses characterize how backbones, scaffolds, budgets, and domains affect BioML coding performance, exposing modeling and execution gaps across agent and LLM backbone families.

cs.CE↗

Stochastic Latent Twins: Learning Stochastic Solution Operators

Scientific prediction under uncertainty requires more than a single future state: it requires the distribution of possible outcomes. We show that this distribution-valued evolution can be learned directly as a stochastic solution operator between arbitrary source and target times. We introduce Stochastic Latent Twins, which represent the physical state through a deterministic encoder-decoder while placing stochasticity entirely in a probability-valued latent evolution map. This separation makes the stochastic transition law independent of the state representation and enables direct probabilistic prediction without recursive time stepping. We establish an end-to-end Wasserstein approximation theory that separates representation and latent-transition errors, derive stability guarantees, and develop a distributional theory of physics conformity with latent-to-physical transfer bounds and conformity by construction. The resulting framework can be learned directly from observed transitions and supports forward prediction, backward conditional evolution, one-shot generation, and physics-conforming stochastic dynamics within the same formulation. Numerical experiments ranging from linear and non-Gaussian SDEs to stochastic Lorenz dynamics, generative modeling, a stochastic Hamiltonian system, and a two-dimensional stochastic Burgers equation verify the theory, expose the distinct roles of state representation and transition-family expressivity, compare favorably with recent stochastic and one-step generative methods, and demonstrate exact physical conservation by construction. More broadly, Stochastic Latent Twins provide a step toward scientific surrogates that represent not only the evolution of a system, but also its uncertainty and physical structure, opening new opportunities across uncertainty quantification, data assimilation, inverse problems, control, and digital twins.

cs.CE↗

Product Costing in Data Pipelines

Large data-intensive enterprises spend millions of dollars monthly running data pipelines. Apportioning this cost back to individual products, known as product costing, is a prerequisite for data pricing and cost recovery. However, this process is fundamentally more challenging than physical manufacturing costing due to the unique characteristics of data pipelines, including the non-rivalrous nature of data that complicates the costing formulation, the prevalence of cyclic dependencies that distort the accuracy of results, and the massive scale of pipelines that leads to computational intractability. In this paper, for the first time, we formalize the problem of product costing in data pipelines as a manufacturing cost of data products (MCDP) problem to overcome the non-rivalrous nature of data. To solve MCDP, we propose CostApp, a hybrid algorithm that achieves both exactness and scalability, even for cyclic and massive-scale pipelines. CostApp performs a dimensionality reduction by isolating cyclic dependencies via a feedback arc set (FAS). It aggregates costs onto a compact set of key vertices using a scalable iterative approach, transforming the intractable computational problem into a reduced linear system that can be solved exactly and efficiently by a basic matrix-based method. Experiments on both real-world data and synthetic data show that CostApp scales to process a production pipeline with over 28 million entities within an hour while preserving exactness, supporting pipelines up to 10^2 larger than the direct matrix-based baseline.

cs.CE↗