Source author record

Zhengyi Zhou

Zhengyi Zhou appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

14works
12topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

14 published item(s)

preprint2026arXiv

SOMA: Efficient Multi-turn LLM Serving via Small Language Model

Large Language Models (LLMs) are increasingly deployed in multi-turn dialogue settings where preserving conversational context across turns is essential. A standard serving practice concatenates the full dialogue history at every turn, which reliably maintains coherence but incurs substantial cost in latency, memory, and API expenditure, especially when queries are routed to large proprietary models. Existing approaches often struggle to balance the trade-off between response quality and efficiency. We propose a framework that exploits the early turns of a session to estimate a local response manifold and then adapt a smaller surrogate model to this local region for the remainder of the conversation. Concretely, we learn soft prompts that maximize semantic divergence between the large and surrogate small language models' responses to surface least-aligned local directions, stabilize training with anti-degeneration control, and distill the mined cases into localized LoRA fine-tuning so the surrogate runs without prompts at inference. A simple gate enables a one-time switch with rollback on drift. We further provide a theoretical analysis for key components in SOMA. Extensive experiments show the effectiveness of SOMA. The source code is provided at: https://github.com/LabRAI/SOMA.

preprint2026arXiv

StackPilot: Autonomous Function Agents for Scalable and Environment-Free Code Execution

Recent advances in large language models (LLMs) have substantially enhanced automated code generation across a wide range of programming languages. Nonetheless, verifying the correctness and executability of LLM-generated code remains a significant challenge, as traditional methods rely on language-specific compilers and environment-dependent runtimes. To overcome these limitations, we introduce StackPilot, an LLM-native, multi-agent framework designed for language-agnostic code verification and execution, which operates independently of conventional toolchains. StackPilot offers three principal innovations: (1) a Function-as-Agents paradigm, in which each function is modeled as an autonomous agent capable of fine-grained reasoning and collaborative verification; (2) an LLM-as-Executor strategy, which enables scalable verification via stack-based scheduling; and (3) a novel snapshot mechanism that preserves complete execution contexts, facilitating deterministic and lossless context switching during verification. Empirical evaluations demonstrate that StackPilot achieves framework reliability rates between 89% and 97%, substantially outperforming baseline approaches. These results indicate that StackPilot can reliably verify and execute a significantly larger proportion of LLM-generated code across diverse programming tasks compared to existing methods.

preprint2022arXiv

Asymptotically holomorphic theory for symplectic orbifolds

We extend Donaldson's asymptotically holomorphic techniques to symplectic orbifolds. More precisely, given a symplectic orbifold such that the symplectic form defines an integer cohomology class, we prove that there exist sections of large tensor powers of the prequantizable line bundle such that their zero sets are symplectic suborbifolds. We then derive a Lefschetz hyperplane theorem for these suborbifolds, that computes their real cohomology up to middle dimension. We also get the hard Lefschetz and formality properties for them, when the ambient manifold satisfies those properties.

preprint2022arXiv

Infinite not contact isotopic embeddings in $(S^{2n-1},ξ_{\mathrm{std}})$ for $n\ge 4$

For $n\ge 4$, we show that there are infinitely many formally contact isotopic embeddings of $(ST^*S^{n-1},ξ_{\mathrm{std}})$ to $(S^{2n-1},ξ_{\mathrm{std}})$ that are not contact isotopic. This resolves a conjecture of Casals and Etnyre except for the $n=3$ case. The argument does not appeal to the surgery formula of critical handle attachment for Floer theory/SFT.

preprint2022arXiv

On filings of $\partial(V\times \mathbb{D})$

We show that any symplectically aspherical/Calabi-Yau filling of $Y:=\partial(V\times \mathbb{D})$ has vanishing symplectic cohomology for any Liouville domain $V$. In particular, we make no topological requirement on the filling and $c_1(V)$ can be nonzero. Moreover, we show that for any symplectically aspherical/Calabi-Yau filling $W$ of $Y$, the interior $\mathring{W}$ is diffeomorphic to the interior of $V\times \mathbb{D}$ if $π_1(Y)$ is abelian and $\dim V\ge 4$. And $W$ is diffeomorphic to $V\times \mathbb{D}$ if moreover the Whitehead group of $π_1(Y)$ is trivial.

preprint2022arXiv

On the minimal symplectic area of Lagrangians

We show that the minimal symplectic area of Lagrangian submanifolds are universally bounded in symplectically aspherical domains with vanishing symplectic cohomology. If an exact domain admits a $k$-semi-dilation, then the minimal symplectic area is universally bounded for $K(π,1)$-Lagrangians. As a corollary, we show that Arnol'd chord conjecture holds for the following four cases: (1) $Y$ admits an exact filling with $SH^*(W)=0$ (for some ring coefficient); (2) $Y$ admits a symplectically aspherical filling with $SH^*(W)=0$ and simply connected Legendrians; (3) $Y$ admits an exact filling with a $k$-semi-dilation and the Legendrian is a $K(π,1)$ space; (4) $Y$ is the cosphere bundle $S^*Q$ with $π_2(Q)\to H_2(Q)$ nontrivial and the Legendrian has trivial $π_2$. In addition, we obtain the existence of homoclinic orbits in case (1). We also provide many more examples with $k$-semi-dilations in all dimensions $\ge 4$.

preprint2021arXiv

Symplectic fillings of asymptotically dynamically convex manifolds II--$k$-dilations

We introduce the concept of $k$-(semi)-dilation for Liouville domains, which is a generalization of symplectic dilation defined by Seidel-Solomon. We prove that the existence of $k$-(semi)-dilation is a property independent of fillings for asymptotically dynamically convex (ADC) manifolds. We construct examples with $k$-dilations, but not $k-1$-dilations for all $k\ge 0$. We extract invariants taking value in $\mathbb{N} \cup \{\infty\}$ for Liouville domains and ADC contact manifolds, which are called the order of (semi)-dilation. The order of (semi)-dilation serves as embedding and cobordism obstructions. We determine the order of (semi)-dilation for many Brieskorn varieties and use them to study cobordisms between Brieskorn manifolds.

preprint2019arXiv

Counterexamples in Scale Calculus

We construct counterexamples to classical calculus facts such as the Inverse and Implicit Function Theorems in Scale Calculus -- a generalization of Multivariable Calculus to infinite dimensional vector spaces in which the reparameterization maps relevant to Symplectic Geometry are smooth. Scale Calculus is a cornerstone of Polyfold Theory, which was introduced by Hofer-Wysocki-Zehnder as a broadly applicable tool for regularizing moduli spaces of pseudoholomorphic curves. We show how the novel nonlinear scale-Fredholm notion in Polyfold Theory overcomes the lack of Implicit Function Theorems, by formally establishing an often implicitly used fact: The differentials of basic germs -- the local models for scale-Fredholm maps -- vary continuously in the space of bounded operators when the base point changes. We moreover demonstrate that this continuity holds only in specific coordinates, by constructing an example of a scale-diffeomorphism and scale-Fredholm map with discontinuous differentials. This justifies the high technical complexity in the foundations of Polyfold Theory.

preprint2019arXiv

Quotient Theorems in Polyfold Theory and $S^1$-Equivariant Transversality

We introduce group actions on polyfolds and polyfold bundles. We prove quotient theorems for polyfolds, when the group action has finite isotropy. We prove that the sc-Fredholm property is preserved under quotient if the base polyfold is infinite dimensional. The quotient construction is the main technical tool in the construction of equivariant fundamental class in [42]. We also analyze the equivariant transversality near the fixed locus in the polyfold setting. In the case of $S^1$-action with fixed locus, we give a sufficient condition for the existence of equivariant transverse perturbations. We outline the application to Hamiltonian-Floer cohomology and a proof of the weak Arnold conjecture for general symplectic manifolds, assuming the existence of Hamiltonian-Floer cohomology polyfolds.

preprint2016arXiv

Predicting Ambulance Demand: Challenges and Methods

Predicting ambulance demand accurately at a fine resolution in time and space (e.g., every hour and 1 km$^2$) is critical for staff / fleet management and dynamic deployment. There are several challenges: though the dataset is typically large-scale, demand per time period and locality is almost always zero. The demand arises from complex urban geography and exhibits complex spatio-temporal patterns, both of which need to captured and exploited. To address these challenges, we propose three methods based on Gaussian mixture models, kernel density estimation, and kernel warping. These methods provide spatio-temporal predictions for Toronto and Melbourne that are significantly more accurate than the current industry practice.

preprint2016arXiv

Quantifying Urban Traffic Anomalies

Detecting and quantifying anomalies in urban traffic is critical for real-time alerting or re-routing in the short run and urban planning in the long run. We describe a two-step framework that achieves these two goals in a robust, fast, online, and unsupervised manner. First, we adapt stable principal component pursuit to detect anomalies for each road segment. This allows us to pinpoint traffic anomalies early and precisely in space. Then we group the road-level anomalies across time and space into meaningful anomaly events using a simple graph expansion procedure. These events can be easily clustered, visualized, and analyzed by urban planners. We demonstrate the effectiveness of our system using 7 weeks of anonymized and aggregated cellular location data in Dallas-Fort Worth. We suggest potential opportunities for urban planners and policy makers to use our methodology to make informed changes. These applications include real-time re-routing of traffic in response to abnormally high traffic, or identifying candidates for high-impact infrastructure projects.

preprint2015arXiv

Predicting Ambulance Demand: a Spatio-Temporal Kernel Approach

Predicting ambulance demand accurately at fine time and location scales is critical for ambulance fleet management and dynamic deployment. Large-scale datasets in this setting typically exhibit complex spatio-temporal dynamics and sparsity at high resolutions. We propose a predictive method using spatio-temporal kernel density estimation (stKDE) to address these challenges, and provide spatial density predictions for ambulance demand in Toronto, Canada as it varies over hourly intervals. Specifically, we weight the spatial kernel of each historical observation by its informativeness to the current predictive task. We construct spatio-temporal weight functions to incorporate various temporal and spatial patterns in ambulance demand, including location-specific seasonalities and short-term serial dependence. This allows us to draw out the most helpful historical data, and exploit spatio-temporal patterns in the data for accurate and fast predictions. We further provide efficient estimation and customizable prediction procedures. stKDE is easy to use and interpret by non-specialized personnel from the emergency medical service industry. It also has significantly higher statistical accuracy than the current industry practice, with a comparable amount of computational expense.

preprint2015arXiv

Predicting Melbourne Ambulance Demand using Kernel Warping

Predicting ambulance demand accurately in fine resolutions in space and time is critical for ambulance fleet management and dynamic deployment. Typical challenges include data sparsity at high resolutions and the need to respect complex urban spatial domains. To provide spatial density predictions for ambulance demand in Melbourne, Australia as it varies over hourly intervals, we propose a predictive spatio-temporal kernel warping method. To predict for each hour, we build a kernel density estimator on a sparse set of the most similar data from relevant past time periods (labeled data), but warp these kernels to a larger set of past data irregardless of time periods (point cloud). The point cloud represents the spatial structure and geographical characteristics of Melbourne, including complex boundaries, road networks, and neighborhoods. Borrowing from manifold learning, kernel warping is performed through a graph Laplacian of the point cloud and can be interpreted as a regularization towards, and a prior imposed, for spatial features. Kernel bandwidth and degree of warping are efficiently estimated via cross-validation, and can be made time- and/or location-specific. Our proposed model gives significantly more accurate predictions compared to a current industry practice, an unwarped kernel density estimation, and a time-varying Gaussian mixture model.

preprint2014arXiv

A Spatio-Temporal Point Process Model for Ambulance Demand

Ambulance demand estimation at fine time and location scales is critical for fleet management and dynamic deployment. We are motivated by the problem of estimating the spatial distribution of ambulance demand in Toronto, Canada, as it changes over discrete 2-hour intervals. This large-scale dataset is sparse at the desired temporal resolutions and exhibits location-specific serial dependence, daily and weekly seasonality. We address these challenges by introducing a novel characterization of time-varying Gaussian mixture models. We fix the mixture component distributions across all time periods to overcome data sparsity and accurately describe Toronto's spatial structure, while representing the complex spatio-temporal dynamics through time-varying mixture weights. We constrain the mixture weights to capture weekly seasonality, and apply a conditionally autoregressive prior on the mixture weights of each component to represent location-specific short-term serial dependence and daily seasonality. While estimation may be performed using a fixed number of mixture components, we also extend to estimate the number of components using birth-and-death Markov chain Monte Carlo. The proposed model is shown to give higher statistical predictive accuracy and to reduce the error in predicting EMS operational performance by as much as two-thirds compared to a typical industry practice.