arXiv subjects

Joseph Ross

Publications and source records attributed to Joseph Ross.

10 recordsLinked to original sources

arXiv2026

Current and temperature imbalances in parallel-connected grid storage battery modules

A key challenge with large battery systems is heterogeneous currents and temperatures in modules with parallel-connected cells. Although extreme currents and temperatures are detrimental to the performance and lifetime of battery cells, there is not a consensus on the scale of typical imbalances within grid storage modules. Here, we quantify these imbalances through simulations and experiments on an industrially representative grid storage battery module consisting of prismatic lithium iron phosphate cells, elucidating the evolution of current and temperature imbalances and their dependence on individual cell and module parameter variations. Using a sensitivity analysis, we find that varying contact resistances and cell resistances contribute strongly to temperature differences between cells, from which we define safety thresholds on cell-to-cell variability. Finally, we investigate how these thresholds change for different applications, to outline a set of robustness metrics that show how cycling at lower C-rates and narrower SOC ranges can mitigate failures.

eess.SY↗

arXiv2025

Cisco Time Series Model Technical Report

We introduce the Cisco Time Series Model, a univariate zero-shot forecaster. This time series foundation model is the result of a general architectural innovation to a time series model enabling it to accept multiresolution input, applied to a popular decoder-only time series model (TimesFM). The resulting multiresolution decoder-only model is trained on over 300B unique data points, with more than half coming from the observability domain. Quantitative and qualitative evaluations demonstrate that the resulting model achieves superior performance on observability datasets while retaining very similar performance on a standard general-purpose forecasting benchmark (GIFT-Eval), and suggest that the multiresolution structure enables the model to make more accurate predictions on long context input.

cs.LG↗

arXiv2024

MAG-V: A Multi-Agent Framework for Synthetic Data Generation and Verification

Extending the capabilities of Large Language Models (LLMs) with functions or tools for environment interaction has led to the emergence of the agent paradigm. In industry, training an LLM is not always feasible because of the scarcity of domain data, legal holds on proprietary customer data, rapidly changing business requirements, and the need to prototype new assistants. Agents provide an elegant solution to the above by relying on the zero-shot reasoning abilities of the underlying LLM and utilizing tools to explore and reason over customer data and respond to user requests. However, there are two concerns here: (I) acquiring large scale customer queries for agent testing is time-consuming, and (II) high reliance on the tool call sequence (or trajectory) followed by the agent to respond to user queries may lead to unexpected or incorrect behavior. To address this, we propose MAG-V, a multi-agent framework to first generate a dataset of questions that mimic customer queries; and second, reverse-engineer alternate questions from the responses for trajectory verification. Initial results indicate that our synthetic data can improve agent performance on actual customer queries. Furthermore, our trajectory verification methodology, inspired by distant supervision and using traditional machine learning (ML) models, outperforms a GPT-4o judge baseline by 11% accuracy and matches the performance of a GPT-4 judge on our constructed dataset. Overall, our approach is a step towards unifying diverse task agents into a cohesive framework for achieving an aligned objective.

cs.CL↗

arXiv2021

Theory meets Practice at the Median: a worst case comparison of relative error quantile algorithms

Estimating the distribution and quantiles of data is a foundational task in data mining and data science. We study algorithms which provide accurate results for extreme quantile queries using a small amount of space, thus helping to understand the tails of the input distribution. Namely, we focus on two recent state-of-the-art solutions: $t$-digest and ReqSketch. While $t$-digest is a popular compact summary which works well in a variety of settings, ReqSketch comes with formal accuracy guarantees at the cost of its size growing as new observations are inserted. In this work, we provide insight into which conditions make one preferable to the other. Namely, we show how to construct inputs for $t$-digest that induce an almost arbitrarily large error and demonstrate that it fails to provide accurate results even on i.i.d. samples from a highly non-uniform distribution. We propose practical improvements to ReqSketch, making it faster than $t$-digest, while its error stays bounded on any instance. Still, our results confirm that $t$-digest remains more accurate on the ``non-adversarial'' data encountered in practice.

cs.DS↗

arXiv2020

Asymmetric scale functions for $t$-digests

The $t$-digest is a data structure that can be queried for approximate quantiles, with greater accuracy near the minimum and maximum of the distribution. We develop a $t$-digest variant with accuracy asymmetric about the median, thereby making possible alternative tradeoffs between computational resources and accuracy which may be of particular interest for distributions with significant skew. After establishing some theoretical properties of scale functions for $t$-digests, we show that a tangent line construction on the familiar scale functions preserves the crucial properties that allow $t$-digests to operate online and be mergeable. We conclude with an empirical study demonstrating the asymmetric variant preserves accuracy on one side of the distribution with a much smaller memory footprint.

cs.DS↗

arXiv2016

An approach to intersection theory on singular varieties using motivic complexes

We introduce techniques of Suslin, Voevodsky, and others into the study of singular varieties. Our approach is modeled after Goresky-MacPherson intersection homology. We provide a formulation of perversity cycle spaces leading to perversity homology theory and a companion perversity cohomology theory based upon generalized cocycle spaces. These theories lead to conditions on pairs of cycles which can be intersected and a suitable equivalence relation on cocycles/cycles enabling pairings on equivalence classes. We establish suspension and splitting theorems, as well as a localization property. Some examples of intersections on singular varieties are computed.

math.KT↗

arXiv2014

Cohomology of presheaves with oriented weak transfers

Over a field of characteristic zero, we establish the homotopy invariance of the Nisnevich cohomology of homotopy invariant presheaves with oriented weak transfers, and the agreement of Zariski and Nisnevich cohomology for such presheaves. This generalizes a foundational result in Voevodsky's theory of motives. The main idea is to find explicit smooth representatives of the correspondences which provide the input for Voevodsky's cohomological architecture.

math.KT↗

arXiv2014

Intersections via resolutions

We investigate the viability of defining an intersection product on algebraic cycles on a singular algebraic variety by pushing forward intersection products formed on a resolution of singularities. For varieties with resolutions having a certain structure (including all varieties over a field of characteristic zero), we obtain a stratification which reflects the geometry of the centers and the exceptional divisors. This stratification is sufficiently fine that divisors can be intersected with $r$-cycles (for $r \geq 1$), and 2-cycles can be intersected on a fourfold, provided their incidences with the strata are controlled. Similar pairings are defined on a variety with one-dimensional singular locus.

math.AG↗

arXiv2012

Cohomology theories with supports

For $E$ a presheaf of spectra on the category of smooth $k$-schemes satisfying Nisnevich excision, we prove that the canonical map from the algebraic singular complex of the theory $E$ with quasi-finite supports to the theory $E$ with supports intersecting all the faces properly is a weak equivalence on smooth $k$-schemes that are affine or projective. This establishes some cases of a conjecture of Marc Levine.

math.KT↗

arXiv2010

The Hilbert-Chow morphism and the incidence divisor

For a smooth projective variety $P$, we construct a Cartier divisor supported on the incidence locus in $\mathscr{C}_a (P) \times \mathscr{C}_{\dim(P)-a-1}(P)$. There is a natural definition of the corresponding line bundle on a product of Hilbert schemes, and we show this bundle descends to the Chow varieties. This answers a question posed by Mazur.

math.AG↗