Searcharxiv⌕ Search

arXiv subjects

Seunghun Lee

Publications and source records attributed to Seunghun Lee.

At least 19 recordsLinked to original sources

Coexisting orders and dipolar Luttinger liquids in $\mathbb{Z}_N$ quantum torus chain

We establish a unified ground-state phase diagram for the one-dimensional $\mathbb{Z}_N$ quantum torus chain, which is connected to dipolar cluster and dipolar Ising chains via noninvertible dualities. Combining tensor-network calculations with bosonization and perturbation theory, we establish a rich phase diagram governed by the local Hilbert-space dimension $N$ and its parity. We identify phases with coexisting $X$ and $Z$ long-range orders ($C$ phase), and dipolar Luttinger liquids (dLL$_{\rm I}$ and dLL$_{\rm II}$) separating coexisting phases from single-order phases. Gapless dipolar excitations coexist with long-range order in dLLs. Both the $C$ and dLL phases appear at $N \geq 5$, but only the $C$ phases persist as $N\to \infty$. The stability of the dLL phase is understood by an emergent Luttinger liquid theory, with Berezinskii-Kosterlitz-Thouless transitions out of it driven by competing umklapp and clock anisotropy perturbations. For odd $N \geq 5$, a third dLL phase (dLL$_{\rm III}$) emerges near $θ= π$ due to the low-energy dynamics inside the exponentially degenerate ground-state manifold that maps onto an effective XXZ chain. Duality considerations suggest a possible gapless dipolar symmetry-protected topological phase and spontaneous dipole-symmetry breaking in dipolar cluster chains.

cond-mat.str-el↗

TinyAstral: Transferring Self-Evolving Harnesses to Tiny Generalist Manipulation Agents

Robot agents built on vision-language models depend on both the planner and its harness: the tools, feedback, memory, and recovery logic around it. Can improvements to a large teacher's harness be carried into a compact agent with lower inference compute cost? We present TinyAstral, a two-stage approach. We first freeze an open-weight teacher and improve its harness through recursive self-improvement (RSI): frontier LLM agents read the teacher's trajectories and propose harness edits, and each edit is accepted only if it passes a paired statistical test. We then freeze the final harness, collect teacher trajectories with reasoning and failure recovery, and distill a small student that replaces the teacher in the same harness. On RoboTwin, harness evolution raises the teacher's success from 33.4% to 63.6%; the final 4B student reaches 62.8%. Across four harness versions, distilled 4B students score close to their corresponding teachers, and later versions yield stronger students, showing that harness evolution gains carry into compact models. The harness gains also transfer to other frozen planners without retraining. On identical episodes, the final 4B student outperforms open 4B agents, the open 27B harness-RSI model SenseNova-RoboRSI, and our own teacher model placed in three competitors' harnesses. It stays close to its teacher on all three training benchmarks, and on three benchmarks never used for RSI or training it scores close to a 552B planner running the same harness. On the measured deployment episodes, it uses about one fifth of its teacher's accelerator time. Project page: https://garfield-kh.github.io/TinyAstral/

cs.RO↗

Colorful circuits and colorful topes in oriented matroids

We provide a short proof of a conic version of the colorful Carathéodory theorem for oriented matroids. Holmsen's extension of the colorful Carathéodory theorem to oriented matroids (Advances in Mathematics, 2016) already encompasses several generalizations of the original result, but not its conic version. Our approach relies on a common generalization of Sperner's lemma and Meshulam's lemma - two closely related results from combinatorial topology that have found a number of applications in discrete geometry and combinatorics. This generalization may be of independent interest. Using a similar approach, we also establish the following colorful theorem for topes, whose special geometric case had not been considered before: Given $n$ topes from a uniform oriented matroid with $n$ elements, if they agree on some element, then there is a way to select a distinct element from each tope, together with its sign, so as to form another tope of the oriented matroid. Motivated by this theorem, we further explore other conditions leading to the same conclusion.

math.CO↗

RAIN: Robotic Task Generalization with Region-Aware Interaction Networks

Existing vision-language-action (VLA) models benefit from large-scale vision-language pretraining, but tend to memorize training trajectories, limiting their ability to adapt learned interactions to new task and scene configurations. To address this problem, we propose \textbf{Region-Aware Interaction Networks (RAIN)}, which formulates a task as a sequence of goal-conditioned subtasks, each specified by an action type and a target-region mask. This formulation allows learned skills to be reused across different objects and scene layouts and composed into task sequences not seen during training. Its Target-adaptive Cross-View Encoder (TCE) conditions multi-view features on target masks and exchanges information across views, while PlanDiT predicts target-directed trajectories and actions. A Transition Head estimates subtask completion to enable automatic transitions. We also introduce a \textbf{Reference-based Retargeting Strategy (RRS)}, which uses recorded trajectories to synthesize smooth approaches to reference interactions with alternative target regions, without collecting additional data. Experiments on \textbf{LIBERO-Analogy}, our new benchmark for robotic task generalization, and real-world tabletop tasks demonstrate that RAIN generalizes more robustly than existing VLA baselines.

cs.RO↗

Retrieval-Augmented Skill Optimization via Cross-Harness Adaptation

An agent skill is a reusable, actionable natural-language artifact that guides an agent to perform a task effectively under a given harness. Recent studies have explored the optimization of agent skills, contributing to a growing collection of publicly available skills spanning diverse tasks, domains, and harnesses. Despite millions of publicly shared skills, existing skill optimization methods largely overlook this accumulated knowledge, instead relying solely on expensive agent rollouts to iteratively refine skills for a target task. To address this, we propose \textbf{Retrieval-Augmented Skill Optimization (RASO)}, a framework that leverages an external skill corpus as prior knowledge throughout skill optimization. RASO retrieves relevant knowledge from existing skills and adapts it to the target task and harness via Cross-Harness Adaptation, accounting for mismatches in both domain and harness. RASO comprises two complementary stages: \textbf{Retrieval-Augmented Skill Initialization (RASI)} constructs a knowledge-grounded initial skill without requiring agent rollouts, while \textbf{Retrieval-Augmented Skill Update (RASU)} iteratively refines the skill by retrieving external knowledge guided by execution feedback. Across four agent benchmarks and two models, extensive experiments show that RASO consistently outperforms baselines without retrieval-augmented skill initialization and updating.

cs.AI↗

EviSplat: Preserving Multi-View Evidence in 3D Gaussian Splatting for Open-Vocabulary Segmentation

Open-vocabulary 3D scene understanding enables object localization and segmentation from free-form text queries without a fixed category vocabulary. Many recent methods build on 3D Gaussian Splatting and consolidate multi-view observations, such as masked crops from individual views, into language features or compact object descriptors before the query is known. However, observations of the same object vary across viewpoints and are not equally informative: some reveal cues relevant to a particular query, whereas others provide incomplete or misleading evidence. Pre-query consolidation can therefore suppress cues on which a later query depends. We introduce EviSplat, which preserves individual observation features as evidence for later text queries. EviSplat retains individual observation features within class-agnostic 3D instances that represent objects, object parts, or background regions. It also learns, for each Gaussian, a distribution describing which visual appearances its observations support. Given a text query, EviSplat scores each instance using its most relevant observations. It then computes a score for each Gaussian by combining instance-level relevance with locally supported evidence, weighted by how often and how unambiguously that Gaussian was observed. Different queries can thus draw on different visual cues from the same preserved evidence. Experiments across diverse datasets and evaluation protocols demonstrate state-of-the-art performance, supporting the benefit of preserving multi-view evidence until query time and aggregating it according to the query.

cs.CV↗

PLED-VINS: A Point-Line Event-Based Visual Inertial SLAM for Dynamic Environments

Dynamic environments remain a fundamental challenge for visual SLAM, where unreliable observations from moving objects and rapid motion degrade state estimation accuracy. Although event cameras preserve fine-grained spatio-temporal information, most existing event-based SLAM frameworks still assume static scenes and lack approaches to estimate the reliability of features. To this end, we propose PLED-VINS, a monocular event camera-based visual-inertial SLAM framework that enables robust state estimation in dynamic environments. We propose an entropy-recency score map to characterize the temporal reliability of both point and line features based on event temporal statistics. Concurrently, geometric reliability is estimated via a unified point-line robust bundle adjustment. Building upon these, we design an adaptive weighting strategy that fuses temporal and geometric reliability, including motion-conditioned reliability modeling for line features, to suppress unreliable observations. Experimental results demonstrate that PLED-VINS improves state estimation on the evaluated dynamic sequences with moving objects.

cs.RO↗

Tensor-Network Algorithm for Many-Body Trace Norms

Trace norms are fundamental to quantum information theory, yet in many-body systems their evaluation remains a major computational bottleneck, as it generally requires diagonalizing exponentially large operators. Here, we overcome this bottleneck by introducing a controlled tensor-network algorithm for estimating the trace norm of matrix product operators without full diagonalization. The key idea is to combine Zolotarev's rational approximation to the sign function with a variational formulation solved using a density-matrix-renormalization-group-like algorithm. The resulting approximation is systematically improvable, with its accuracy controlled by the rational approximation parameters and the spectral weight near zero. Beyond the reach of exact diagonalization, we demonstrate controlled trace-norm calculations for entanglement negativity, quantum fidelity and quantum Fisher information, achieving substantially improved accuracy over polynomial-based Lanczos approaches. Our results establish trace-norm-based quantities as practical tensor-network observables, opening a route toward tensor-network studies of quantum information in mixed states.

quant-ph↗

Robust Mixed-State Cluster States and Spurious Topological Entanglement Negativity

We investigate 1D and 2D cluster states under local decoherence to assess the robustness of their mixed-state subsystem symmetry-protected topological (SSPT) order. By exactly computing fidelity correlators via dimensional reduction of effective statistical mechanics models, we pinpoint the critical error rate for strong-to-weak spontaneous breaking of strong subsystem symmetry. Without resorting to the replica trick, we demonstrate that mixed-state SSPT order remains remarkably robust up to the maximal decoherence rate when noise respects strong subsystem symmetry. Furthermore, we propose that the mixed-state SSPT order can be detected by a constant correction to the area-law scaling of entanglement negativity, termed spurious topological entanglement negativity. This also highlights that topological entanglement negativity, a widely used diagnostic for mixed-state topological order, is generally not invariant under finite-depth quantum channels.

quant-ph↗

Mixed-State Topological Order under Coherent Noise

Mixed-state phases of matter under local decoherence have recently garnered significant attention due to the ubiquitous presence of noise in current quantum processors. One of the key issues is understanding how topological quantum memory is affected by realistic coherent noise, such as random rotation noise and amplitude-damping noise. In this work, we investigate the intrinsic error threshold of the two-dimensional toric code (TC), a paradigmatic topological quantum memory, under these types of coherent noise by employing both analytical and numerical methods based on the doubled-Hilbert-space formalism. A connection between the mixed-state phase of the decohered TC and a non-Hermitian Ashkin-Teller-type statistical-mechanics model is established, and the mixed-state phase diagrams under the coherent noise are obtained. We find remarkable stability of mixed-state topological order under random rotation noise with axes near the $Y$-axis of qubits. We also identify intriguing extended critical regions at the phase boundaries, highlighting a connection with non-Hermitian physics. We argue that these phase boundaries provide upper bounds for the intrinsic error threshold, beyond which quantum error correction becomes impossible. We complement these findings by estimating the error thresholds for random rotation noise under standard quantum error correction, thereby providing lower bounds on the intrinsic error threshold.

quant-ph↗

Learning to Solve Generative ODEs Beyond the Linear Span

Diffusion and flow generative models sample by integrating a learned ODE, but high quality still requires many sequential model evaluations. Solver learning reduces this cost by adapting scalar coefficients, timesteps, or both, while keeping the backbone model fixed. In this work, we identify a structural bottleneck in this update family: each step remains span-limited. Since the scalar-coefficient update lies in the span of buffered velocity evaluations, it can fit only the in-span component while leaving any out-of-span residual unreachable by scalar recombination alone. We propose SpanLift, a lightweight neural solver that augments scalar-coefficient updates with a spatial residual operator. SpanLift keeps a fixed base solver as an in-span prior and learns a spatial residual operator over the state and velocity buffer. The operator is trained by endpoint teacher matching, preserves the pretrained backbone, and adds no model NFEs. Empirically, the learned correction transfers across base solvers and is predominantly out-of-span. Across pixel-space diffusion, latent flow matching, and precipitation nowcasting, SpanLift achieves state-of-the-art few-step sampling. With only 3 NFE, it improves CIFAR-10 FID from 8.16 to 5.69 and ImageNet FID from 17.37 to 11.83.

cs.CV↗

Low-Latency Edge LLM Handover via Joint KV Cache Transfer and Token Prefill

Edge deployment of large language models (LLMs) can reduce latency for interactive services, but mobility introduces service interruptions when an user equipment (UE) hands over between base stations (BSs). To promptly resume decoding, the target-side edge server must recover the UE context state, which can be provisioned either by token forwarding followed by prefill computation or by direct key-value (KV) cache transmission over backhaul. This paper proposes a unified handover (HO) design that jointly selects the prefill length and schedules backhaul KV cache delivery to minimize the worst-user LLM HO delay for multiple UEs. The resulting scheme admits a tractable step-wise solution with explicit feasibility conditions and a constructive rate-scheduling policy. Simulations show that the proposed method consistently outperforms baselines across a wide range of backhaul capacities, prefill speeds, and context sizes, providing practical guidelines for mobility-aware Edge LLM token streaming.

eess.SP↗

CVA: Context-aware Video-text Alignment for Video Temporal Grounding

We propose Context-aware Video-text Alignment (CVA), a novel framework to address a significant challenge in video temporal grounding: achieving temporally sensitive video-text alignment that remains robust to irrelevant background context. Our framework is built on three key components. First, we propose Query-aware Context Diversification (QCD), a new data augmentation strategy that ensures only semantically unrelated content is mixed in. It builds a video-text similarity-based pool of replacement clips to simulate diverse contexts while preventing the ``false negative" caused by query-agnostic mixing. Second, we introduce the Context-invariant Boundary Discrimination (CBD) loss, a contrastive loss that enforces semantic consistency at challenging temporal boundaries, making their representations robust to contextual shifts and hard negatives. Third, we introduce the Context-enhanced Transformer Encoder (CTE), a hierarchical architecture that combines windowed self-attention and bidirectional cross-attention with learnable queries to capture multi-scale temporal context. Through the synergy of these data-centric and architectural enhancements, CVA achieves state-of-the-art performance on major VTG benchmarks, including QVHighlights and Charades-STA. Notably, our method achieves a significant improvement of approximately 5 points in Recall@1 (R1) scores over state-of-the-art methods, highlighting its effectiveness in mitigating false negatives.

cs.LG↗

Polytopes with large transversal ratio

The transversal ratio of a polytope $P$ is the minimum proportion of vertices of $P$ required to intersect each facet of $P$. The weak chromatic number of $P$ is the minimum number of colors required to color the vertices of $P$ so that no facet is monochromatic. We will construct an infinite family of $d$-polytopes for each $d\geq 5$ whose transversal ratio approaches 1 as the number of vertices grows. In particular, this implies that the weak chromatic number for $d$-polytopes is unbounded for each $d\geq 5$. The previous best known lower bounds on the supremum of the transversal ratio for $d$-polytopes for $d\geq 5$ were 2/5 for odd $d$ by Novik and Zheng, and 1/2 for even $d$ by Holmsen, Pach, and Tverberg. In the case of simplicial $(d-1)$-spheres, the best known lower bounds were 1/2 for $d=5$ and $6/11$ for $d=6$ by Novik and Zheng.

math.CO↗

On colorings of hypergraphs embeddable in $\mathbb{R}^d$

The (weak) chromatic number of a hypergraph $H$, denoted by $χ(H)$, is the smallest number of colors required to color the vertices of $H$ so that no hyperedge of $H$ is monochromatic. For every $2\le k\le d+1$, denote by $χ_L(k,d)$ (resp. $χ_{PL}(k,d)$) the supremum $\sup_H χ(H)$ where $H$ runs over all finite $k$-uniform hypergraphs such that $H$ forms the collection of maximal faces of a simplicial complex that is linearly (resp. PL) embeddable in $\mathbb{R}^d$. Following the program by Heise, Panagiotou, Pikhurko and Taraz, we improve their results as follows: For $d \geq 3$, we show that A. $χ_L(k,d)=\infty$ for all $2\le k\le d$, B. $χ_{PL}(d+1,d)=\infty$ and C. $χ_L(d+1,d)\ge 3$ for all odd $d\ge 3$. As an application, we extend the results by Lutz and Møller on the weak chromatic number of the $s$-dimensional faces in the triangulations of a fixed triangulable $d$-manifold $M$: D. $χ_s(M)=\infty$ for $1\leq s \leq d$.

math.CO↗

Bridging Geometric and Semantic Foundation Models for Generalized Monocular Depth Estimation

We present Bridging Geometric and Semantic (BriGeS), an effective method that fuses geometric and semantic information within foundation models to enhance Monocular Depth Estimation (MDE). Central to BriGeS is the Bridging Gate, which integrates the complementary strengths of depth and segmentation foundation models. This integration is further refined by our Attention Temperature Scaling technique. It finely adjusts the focus of the attention mechanisms to prevent over-concentration on specific features, thus ensuring balanced performance across diverse inputs. BriGeS capitalizes on pre-trained foundation models and adopts a strategy that focuses on training only the Bridging Gate. This method significantly reduces resource demands and training time while maintaining the model's ability to generalize effectively. Extensive experiments across multiple challenging datasets demonstrate that BriGeS outperforms state-of-the-art methods in MDE for complex scenes, effectively handling intricate structures and overlapping objects.

cs.CV↗

On an extension problem on the moment curve

We show that for $2\le d\le 4$, every finite geometric simplicial complex $Δ$ in $\mathbb{R}^d$ with vertices on the moment curve can be extended to a triangulation $T$ of the cyclic polytope $C$ where $Δ, T$ and $C$ all have the same vertex set. Further, for $d\ge 5$ we construct for every $n\ge d+3$ complexes $Δ$ on $n$ vertices for which no such triangulations $T$ exist. Our result for $d=4$ has the following novel algebraic application, due to a correspondence by Oppermann and Thomas (JEMS, 2012): every maximal rigid object in $\mathcal{O}_{A_n^{2}}$ is cluster tilting, where $\mathcal{O}_{A_n^δ}$ denotes a higher dimensional cluster category introduced by Oppermann and Thomas for $A_n^δ$, where $A_n^δ$ denotes a higher Auslander algebra of linearly oriented type $A$.

math.CO↗