SearcharxivSearch

arXiv subjects

Wei-Cheng Huang

Publications and source records attributed to Wei-Cheng Huang.

11 recordsLinked to original sources

Linear equations on $t$-modules

Let $F$ be a number field. Given finitely many $F$-valued points on a commutative algebraic group defined over $F$, a question of interest to number theorists is the determination of the group of their linear relations. In this article, we investigate an analogous problem in the $t$-module setting. Let $L$ be a global function field, and $E$ be a $d$-dimensional $t$-module defined over $L$. Given finitely many points on $E$ with entries in $L$, we establish the connection between their $\mathbb{F}_q[t]$-linear relations and polynomial solutions of Frobenius difference equations. Consequently, we deduce an algorithm to compute the module of their $\mathbb{F}_q[t]$-linear relations.

math.NT

Simulation-Ready Cluttered Scene Estimation via Physics-aware Joint Shape and Pose Optimization

Estimating simulation-ready scenes from real-world observations is crucial for downstream planning and policy learning tasks. Regretfully, existing methods struggle in cluttered environments, often exhibiting prohibitive computational cost, poor robustness, and restricted generality when scaling to multiple interacting objects. We propose a unified optimization-based formulation for real-to-sim scene estimation that jointly recovers the shapes and poses of multiple rigid objects under physical constraints. Our method is built on two key technical innovations. First, we leverage the recently introduced shape-differentiable contact model, whose global differentiability permits joint optimization over object geometry and pose while modeling inter-object contacts. Second, we exploit the structured sparsity of the augmented Lagrangian Hessian to derive an efficient linear system solver whose computational cost scales favorably with scene complexity. Building on this formulation, we develop an end-to-end Simulation-ready Physics-Aware Reconstruction for Cluttered Scenes (SPARCS) pipeline, which integrates learning-based object initialization, physics-constrained joint shape-pose optimization, and differentiable texture refinement. Experiments on cluttered scenes with up to 5 objects and 22 convex hulls demonstrate that our approach robustly reconstructs physically valid, simulation-ready object shapes and poses. Project webpage: https://rory-weicheng.github.io/SPARCS/.

cs.RO

ComFree-Sim: A GPU-Parallelized Analytical Contact Physics Engine for Scalable Contact-Rich Robotics Simulation and Control

Physics simulation for contact-rich robotics is often bottlenecked by contact resolution: mainstream engines enforce non-penetration and Coulomb friction via complementarity constraints or constrained optimization, requiring per-step iterative solves whose cost grows superlinearly with contact density. We present ComFree-Sim, a GPU-parallelized analytical contact physics engine built on complementarity-free contact modeling. ComFree-Sim computes contact impulses in closed form via an impedance-style prediction--correction update in the dual cone of Coulomb friction. Contact computation decouples across contact pairs and becomes separable across cone facets, mapping naturally to GPU kernels and yielding near-linear runtime scaling with the number of contacts. We further extend the formulation to a unified 6D contact model capturing tangential, torsional, and rolling friction, and introduce a practical dual-cone impedance heuristic. ComFree-Sim is implemented in Warp and exposed through a MuJoCo-compatible interface as a drop-in backend alternative to MuJoCo Warp (MJWarp). Experiments benchmark penetration, friction behaviors, stability, and simulation runtime scaling against MJWarp, demonstrating near-linear scaling and 2--3 times higher throughput in dense contact scenes with comparable physical fidelity. We deploy ComFree-Sim in real-time MPC for in-hand dexterous manipulation on a real-world multi-fingered LEAP hand and in dynamics-aware motion retargeting, demonstrating that low-latency simulation yields higher closed-loop success rates and enables practical high-frequency control in contact-rich tasks.

cs.RO

Convolutions of Goss and Pellarin $L$-series

We establish special value results of convolutions of Goss and Pellarin $L$-series attached to Drinfeld modules that take values in Tate algebras. Applying the class module formula of Demeslay to certain rigid analytic twists of one Drinfeld module by another, we extend the special value formula for the Pellarin $L$-function associated to the Carlitz module and the Anderson-Thakur function to Drinfeld modules of arbitrary rank and their rigid analytic trivializations. By way of the theory of Schur polynomials these identities take the form of specializations of convolutions of Rankin-Selberg type. These convolution $L$-series are also identified with covolumes of Stark units.

math.NT

OVOR: OnePrompt with Virtual Outlier Regularization for Rehearsal-Free Class-Incremental Learning

Recent works have shown that by using large pre-trained models along with learnable prompts, rehearsal-free methods for class-incremental learning (CIL) settings can achieve superior performance to prominent rehearsal-based ones. Rehearsal-free CIL methods struggle with distinguishing classes from different tasks, as those are not trained together. In this work we propose a regularization method based on virtual outliers to tighten decision boundaries of the classifier, such that confusion of classes among different tasks is mitigated. Recent prompt-based methods often require a pool of task-specific prompts, in order to prevent overwriting knowledge of previous tasks with that of the new task, leading to extra computation in querying and composing an appropriate prompt from the pool. This additional cost can be eliminated, without sacrificing accuracy, as we reveal in the paper. We illustrate that a simplified prompt-based method can achieve results comparable to previous state-of-the-art (SOTA) methods equipped with a prompt pool, using much less learnable parameters and lower inference cost. Our regularization method has demonstrated its compatibility with different prompt-based methods, boosting those previous SOTA rehearsal-free CIL methods' accuracy on the ImageNet-R and CIFAR-100 benchmarks. Our source code is available at https://github.com/jpmorganchase/ovor.

cs.LG

Consensus Complementarity Control for Multi-Contact MPC

We propose a hybrid model predictive control algorithm, consensus complementarity control (C3), for systems that make and break contact with their environment. Many state-of-the-art controllers for tasks which require initiating contact with the environment, such as locomotion and manipulation, require a priori mode schedules or are too computationally complex to run at real-time rates. We present a method based on the alternating direction method of multipliers (ADMM) that is capable of high-speed reasoning over potential contact events. Via a consensus formulation, our approach enables parallelization of the contact scheduling problem. We validate our results on five numerical examples, including four high-dimensional frictional contact problems, and a physical experimentation on an underactuated multi-contact system. We further demonstrate the effectiveness of our method on a physical experiment accomplishing a high-dimensional, multi-contact manipulation task with a robot arm.

cs.RO

Adaptive Contact-Implicit Model Predictive Control with Online Residual Learning

The hybrid nature of multi-contact robotic systems, due to making and breaking contact with the environment, creates significant challenges for high-quality control. Existing model-based methods typically rely on either good prior knowledge of the multi-contact model or require significant offline model tuning effort, thus resulting in low adaptability and robustness. In this paper, we propose a real-time adaptive multi-contact model predictive control framework, which enables online adaption of the hybrid multi-contact model and continuous improvement of the control performance for contact-rich tasks. This framework includes an adaption module, which continuously learns a residual of the hybrid model to minimize the gap between the prior model and reality, and a real-time multi-contact MPC controller. We demonstrated the effectiveness of the framework in synthetic examples, and applied it on hardware to solve contact-rich manipulation tasks, where a robot uses its end-effector to roll different unknown objects on a table to track given paths. The hardware experiments show that with a rough prior model, the multi-contact MPC controller adapts itself on-the-fly with an adaption rate around 20 Hz and successfully manipulates previously unknown objects with non-smooth surface geometries.

cs.RO

Tensor products of Drinfeld modules and convolutions of Goss $L$-series

Following the same framework of the special value results of convolutions of Goss and Pellarin $L$-series attached to Drinfeld modules that take values in Tate algebras by Papanikolas and the author, we establish special value results of convolutions of two Goss $L$-series attached to Drinfeld modules that take values in ${\mathbb{F}_q}(\!(\frac{1}θ)\!).$ Applying the class module formula of Fang to tensor products of two Drinfeld modules, we provide special value formulas for their $L$-functions. By way of the theory of Schur polynomials these identities take the form of specializations of convolutions of Rankin-Selberg type. Finally, we show an explicit computation of the regulators appearing in Fang's class module formula for tensor products as well as symmetric and alternating squares of Drinfeld modules.

math.NT

A note on log-algebraicity on elliptic curves

We analyze log-algebraic power series identities for formal groups of elliptic curves over $\mathbb{Q}$ which arise from modular parametrizations. We further investigate applications to special values of elliptic curve $L$-functions.

math.NT

Improving Cross-Lingual Reading Comprehension with Self-Training

Substantial improvements have been made in machine reading comprehension, where the machine answers questions based on a given context. Current state-of-the-art models even surpass human performance on several benchmarks. However, their abilities in the cross-lingual scenario are still to be explored. Previous works have revealed the abilities of pre-trained multilingual models for zero-shot cross-lingual reading comprehension. In this paper, we further utilized unlabeled data to improve the performance. The model is first supervised-trained on source language corpus, and then self-trained with unlabeled target language data. The experiment results showed improvements for all languages, and we also analyzed how self-training benefits cross-lingual reading comprehension in qualitative aspects.

cs.CL

A $t$-motivic interpretation of shuffle relations for multizeta values

Thakur (2010) showed that, for $r,$ $s\in \mathbb{N}$, a product of two Carlitz zeta values $ζ_A(r)$ and $ζ_A(s)$ can be expressed as an $\mathbb{F}_p$-linear combination of $ζ_A(r+s)$ and double zeta values of weight $r+s$. Such an expression is called shuffle relation by Thakur. Fixing $r,$ $s\in \mathbb{N}$, we construct a $t$-module $E'$. To determine whether an $(r+s)$-tuple $\mathfrak{C}$ in $\mathbb{F}_q(θ)^{r+s}$ gives a shuffle relation, we relate it to the $\mathbb{F}_q[t]$-torsion property of the point $\mathbf{v}_\mathfrak{C}\in E'(\mathbb{F}_q[θ])$ constructed with respect to the given $(r+s)$-tuple $\mathfrak{C}$. We also provide an effective criterion for deciding the $\mathbb{F}_q[t]$-torsion property of the point $\mathbf{v}_\mathfrak{C}$.

math.NT