Searcharxiv⌕ Search

arXiv subjects

Yipeng Wang

Publications and source records attributed to Yipeng Wang.

At least 19 recordsLinked to original sources

A new family of maximal curves not covered by the Hermitian curve

For every prime power $q$ and integer $n\ge1$, we give a single Kummer equation defining an $\mathbb{F}_{q^{2n}}$-maximal curve $\mathcal X_{q,n}$. The family recovers the Hermitian curves for $n=1,2$, the Giulietti--Korchmáros curve for $n=3$, and the Beelen--Montanucci curves for odd $n\ge5$. For $q>2$ and even $n\ge4$, it gives new maximal curves of genus $(q^2-1)q^n/2$ that are not covered by the Hermitian curve over $\mathbb{F}_{q^{2n}}$. We compute the genus for both parities of $n$ and give a uniform proof of maximality by counting rational places. For $q>2$ and odd $n\ge5$, we remove the Galois hypothesis from the known non-covering results for the Beelen--Montanucci and Garcia--Güneri--Stichtenoth curves. For even $n\ge4$, we determine the full automorphism group,of order $(q^n+1)q(q^2-1)$, and give explicit equations and genera for all Galois quotients, with closed-form equations for several classes of subgroups.

math.NT↗

MABEL: An Open Anthropomorphic Mobile Bimanual Platform for Teleoperation and Learning

As robot learning moves beyond the tabletop, many tasks require mobility, adjustable reach, active perception, and bimanual dexterity. Commercial platforms combining these capabilities are costly, while affordable open-source alternatives cover only a subset and require software integration. We present MABEL, an open-source anthropomorphic mobile bimanual robot with 56 degrees of freedom (DOF) and a US$8.1k parts cost. It combines two 7-DOF arms with 17-DOF hands, a pitching torso, a lift, a 3-DOF neck, and a holonomic base. Back-drivable arms and torso support compliant interaction, with fingertip reach from floor level to 2.23 m. The head and torso roughly triple modeled camera coverage relative to a torso-fixed camera. Apple Vision Pro head and hand tracking enables whole-body teleoperation without handheld controllers, with 137 ms mean glass-to-glass stereo video latency over the robot's Wi-Fi hotspot. We demonstrate an end-to-end imitation learning pipeline, from teleoperated data collection to policy deployment, using a shared command interface and whole-body controller.

cs.RO↗

Noise-shaped Sampling and Annealing for Scalable On-the-edge Training of Binary and Ternary AI Models

The training loss of binary and ternary neural networks, expanded as a multilinear polynomial over the discrete weights, is structurally equivalent to the energy of a hierarchical high-order Ising model. We exploit this equivalence to apply Ising solvers to discrete-weight network training, while accounting for a fundamental difference in objectives: an Ising solver seeks the ground state of a fixed energy function, whereas training seeks solutions that generalize to unseen data. Our key contribution is $ΣΔ$-Sampler, an optimizer that reconciles these objectives by embedding a stochastic sampling-and-annealing step as a noisy quantizer inside a first-order $ΣΔ$ noise-shaping loop. The loop pushes noise from weight quantization, high-order frustration, and mini-batch sampling out of the low-frequency adaptation band, so that discrete weight updates follow the smooth descent trajectories embedded in the rugged loss landscape. We validate the framework on a planted quadratic unconstrained binary optimization (QUBO) benchmark with a known minimizer; on CIFAR-10, where a $13$M-parameter ternary model comes within $1\%$ of full-precision accuracy; on ImageNet-1k, where a ternary ResNet-18 comes within $0.4\%$ Top-5 accuracy of a ternary baseline; on class-incremental continual learning, where prior-task accuracy is preserved; and on MatMul-free language models up to $2.7$B parameters, where it outperforms a straight-through-estimator baseline under matched continued pre-training. Compared with standard quantization-aware training, $ΣΔ$-Sampler reduces the training memory footprint by over $50\%$, delivers an order-of-magnitude speed-up, and reduces weight-update memory traffic by four orders of magnitude, making it attractive for on-device training and fine-tuning of large binary and ternary models.

cs.LG↗

EgoPush: Egocentric Multi-Object Rearrangement for Mobile Robots via Constrained Teacher Observability

Humans rearrange objects in cluttered environments using egocentric perception, actively moving to keep task-relevant spatial cues in view. Mobile robots have not matched this: rearrangement is usually built on a global pose estimate or a map, which is exactly what a robot carrying one camera lacks, while pushing keeps changing the scene it would have to be built from. We present EgoPush, which pushes objects into anchor-relative formations from onboard RGB-D alone, with no global localization, external tracking, or map at deployment, and transfers zero-shot to a TurtleBot in controlled and visually cluttered scenes. What makes this learnable turns out to be a property of the teacher rather than of the student: three privileged teachers trained with identical rewards, architecture, and hyperparameters all exceed $98\%$ success, yet their distilled egocentric students reach $0\%$, $54.8\%$, and $87.3\%$, the only variable being the teacher's observation function. EgoPush therefore trains the teacher under egocentric observability constraints, restricting it to visibility-limited cues and revealing target references only when the anchor is centrally visible, so that its supervision is recoverable by a depth-based student distilled online. Making the teacher trainable in the first place needs two further pieces: a role-grouped object-centric interface shared by teacher and student, and stage-wise temporally decayed rewards for long-horizon credit assignment. Videos, the playable task, and code are available at https://ai4ce.github.io/EgoPush/.

cs.RO↗

Explicit equations of Galois subfields of Hermitian function fields with respect to decomposition groups

Let $q$ be a prime power and $\mathbb{F}_{q^2}$ be the finite fields of $q^2$ elements. The Hermitian function field $H=\mathbb{F}_{q^2}(x,y)$ defined by $y^q+y=x^{q+1}$ is a well-known maximal function field with the largest possible genus. Let $A(P_\infty)$ be the decomposition group of the infinity place $P_\infty$ of $H$ which is the common pole of $x$ and $y$. For every subgroup $G\le A(P_\infty)$, we construct explicit generators of Galois subfield $H^G$ of $H$ with respect to $G$ and determine an absolutely irreducible equation defining the smooth affine plane model for such a Galois subfield. For $p$-subgroups, the generators can be chosen so that the defining equation has an additive polynomial on the left-hand side and an $\mathbb{F}_p$-quadratic polynomial on the right-hand side. For $q=27$, we can construct a genus-two subfield $D\subset H$ that is not isomorphic to $H^J$ for any subgroup $J\le \text{Aut}(H)$ from the explicit equations of Galois subfields of the Hermitian function field. To the best of our knowledge, this is the first example of a maximal function field covered but not Galois-covered by the same Hermitian function field.

math.NT↗

KuaiRP Series Role-playing Models Technical Report

This paper introduces the complete technical solution for the KuaiRP series of role-playing models. We aim to achieve four core objectives for a dedicated role-playing model: simplified prompt engineering, highly stable output quality, built-in domain world knowledge, and high-efficiency deployment with a small parameter size. However, effectively injecting deep domain knowledge often leads to a severe catastrophic forgetting of the model's general agent capabilities. To overcome this trade-off, we propose a multi-stage training pipeline. First, we design a standardized character template and construct an SFT data pipeline based on user behavior simulation and reverse profile filtering. Next, we utilize a rule-based composite reward function during the Reinforcement Learning (RL) phase to eliminate common degradation phenomena like length expansion and repetitive generation. Finally, to recover the general capabilities compromised during SFT and RL, we propose a novel self-distillation paradigm using Two-stage On-Policy Distillation (OPD) equipped with Cumulative-Divergence Decay (CDD). By using the domain-adapted model as the teacher and the original base model as the student, we effectively balance deep domain knowledge injection with the preservation of general agent capabilities. Experimental results demonstrate that the KuaiRP models not only match the current state-of-the-art proprietary models in role-playing fidelity within our target domains, but also successfully recover general agent capabilities, maintaining extremely low deployment costs.

cs.AI↗

Rigidity and flexibility under positive isotropic curvature

For every $n\ge4$ and $L>0$, we construct a smooth $4$-PIC metric on $S^n$ with Urysohn $1$-width at least $L$ and an embedded stable minimal disk of intrinsic inradius at least $L$. These examples disprove the proposed width and stable-disk radius bounds under a positive lower bound for isotropic curvature. On closed even-dimensional manifolds, we prove the sharp estimate $λ_1^{(2)}\ge(n-1)σ/2$ under $σ$-PIC and show that equality forces roundness if a closed eigenform attaining the bound has rank at least four at some point.

math.DG↗

Minimal Two-Spheres and Manifolds with Positive Isotropic Curvature

We improve the Micallef--Moore index estimate for harmonic two-spheres in $n$-manifolds with positive isotropic curvature to the sharp bound $n-3$. Combining with recent work, this completes the diffeomorphism classification of closed manifolds with positive isotropic curvature in the remaining dimensions five and six.

math.DG↗

Advances and Challenges of Multi-task Learning Method in Recommender System: A Survey

Multi-task learning has been widely applied in computational vision, natural language processing and other fields, which has achieved well performance. In recent years, a lot of work about multi-task learning recommender system has been yielded, but there is no previous literature to summarize these works. To bridge this gap, we provide a systematic literature survey about multi-task recommender systems, aiming to help researchers and practitioners quickly understand the current progress in this direction. In this survey, we first introduce the background and the motivation of the multi-task learning-based recommender systems. Then we provide a taxonomy of multi-task learning-based recommendation methods according to the different stages of multi-task learning techniques, which including task relationship discovery, model architecture and optimization strategy. Finally, we raise discussions on the application and promising future directions in this area.

cs.IR↗

Whose Posts Get Ranked: Identical-Text Exposure Gaps in Bluesky Custom Feeds

Bluesky lets users deploy custom feeds, independently operated recommendation algorithms that the platform serves alongside thousands of others. This paper investigates how evenly these feeds treat posts with the same text. To measure this, we take repeated snapshots of the Top-50 lists that 1,366 public feeds return, and we group posts with identical text, from different authors, that were created before the same list response and closely matched in age. Exposure diverges widely inside these matched sets, which span 250 feeds: in 33% of sets, one copy appears on the list while another does not. Fixed-effects regressions show that this divergence is associated with the author's history on the specific feed. Authors new to a feed receive less exposure for the same text (-0.061 in reciprocal-rank weight), while authors whose posts the feed has returned before receive more. A new author with more followers than the competing author still loses 74\% of head-to-head comparisons. Media and post-type features show no detectable association after multiple-comparison correction. These results are early evidence that access to many independent feeds is not enough to give identical texts equal exposure.

cs.SI↗

Predicting Custom-Feed Returns for New Bluesky Posts: A Prospective Study

The conventional approach to cold-start recommendation addresses new users or newly introduced items. Bluesky custom feeds create a different setting: independently operated feeds filter content from a shared public stream. In this setting, newly published posts are the cold-start objects, while the feeds serve as candidates. We propose a cold-start routing task in which a newly ingested public post is the query and all rankable feeds in the monitored panel are ranked according to whether each will subsequently return it. We build a still-evolving collect-first, label-later benchmark dataset. The collected dataset covers a fixed panel of 5,000 monitored feeds and contains 17.804 million public posts, 1.865 million observable post--feed return records, and 625,083 valid feed polls. The labels record whether a post is observed among a feed's AppView Top-50 results in at least one poll during the 24 hours after publication. The current experiments use two disjoint 24-hour test folds, each paired with a 24-hour training window and separated by a 24-hour outcome-availability gap. Evaluation is conditional on the 602,186 test posts that have at least one positive observed label and satisfy the metric eligibility criteria; these posts account for 9.04% of all 6,661,658 test posts. Across the two folds, LambdaRank achieves the best equal-fold mean values among the evaluated models: 0.7361 for capped Recall@10, 0.6127 for NDCG@10, and 0.7749 for Hit@10.

cs.IR↗

Observation of Iron Oxide to Nitride Conversion via Liquid Liquid Phase Separation in High pressure Borate Melt

High pressure chemistry provides a powerful route to materials that are inaccessible or difficult to synthesize under ambient conditions. However, high pressure chemical reaction processes and mechanisms remain largely unexplored because of the challenges associated with in situ characterization under high pressure and high temperature, particularly within the deeply enclosed sample environment of a large volume press. Here, we employ the state of the art real time synchrotron X ray radiography to image a high pressure chemical reaction at 5.4 GPa and 1700 K within a large volume press. Using Fe2O3 and BN as precursors, we capture the complete dynamic metal oxide to nitride conversion and show that it differs fundamentally from conventional solid state diffusion controlled nitridation. Synchrotron X ray radiography clearly revealed that this conversion involves a two stage liquid liquid separation process (LLPS), including fluid nitrogen and fluid Fe N alloy. On the basis of these observations, we propose a nitrogen driven mechanism for LLPS in borate melts. Specifically, nitrogen reduces metal cations in the borate network, altering their coordination environments and triggering a substantial reorganization of the melt structure. This coordination induced restructuring destabilizes the borate melt and promotes the LLPS of fluid Fe N alloy. Our in-situ observations suggest a general pathway for high pressure metal oxide to nitride conversion. This study provides a direct visualization of a pres-sure-enabled chemical reaction that is inaccessible under ambient conditions, offering fundamental in-sight into how high pressure reshapes chemical reaction pathways and enables the synthesis of metal nitrides.

physics.chem-ph↗

TRACE Bench: Task-driven Roleplay Agentic Checklist Evaluation

Roleplay evaluation should do more than assign a single score: it should reveal which role requirements were tested, which failed, and which dialogue evidence supports the judgment. We propose TRACE Bench, a task-driven agentic checklist evaluation framework. It decomposes each role profile offline into a fixed checklist, then uses a User Agent to converse naturally with the target roleplay model while privately updating checklist states from model responses. Scores therefore trace back to checklist items and supporting dialogue turns rather than a black-box holistic impression. For coverage cross-validation, we audit released M2 free-dialogue transcripts from the MiniMax Role-play Benchmark against the same role-derived checklist. The released free-chat transcripts cover only 73.74% of key role-profile points, whereas TRACE Bench reaches 99.91% coverage in fewer turns. Robustness experiments show stable rankings under repeated runs and User Agent replacement. Across 26 models, TRACE Bench reports overall rankings together with capability breakdowns and checklist traces. It also supports Closed-Loop Benchmark Evolution, distilling verification methods proven effective in failed traces so later evaluations can more reliably elicit and examine observed failure modes.

cs.CL↗

Flex4DHuman: Flexible Multi-view Video Diffusion for 4D Human Reconstruction

We present Flex4DHuman, a multi-view video diffusion model that transforms a monocular or sparse multi-view video of a dynamic subject into synchronized dense multi-view videos using only relative camera-pose conditioning. Unlike prior human-centric methods that rely on skeletons, depth maps, normals, or rendered target-view geometry, Flex4DHuman requires no explicit geometry priors and instead conditions generation through relative camera-pose positional encoding. The generated videos can be directly ingested by downstream reconstruction pipelines to create dynamic 4D Gaussian splats. Built on the Wan 2.1 1.3B text-to-video model, Flex4DHuman preserves the backbone architecture and encodes camera and view information through a five-axis positional encoding that extends spatio-temporal RoPE with view indices and continuous SE(3) relative camera geometry. A three-stage curriculum progressively trains the model for pose following, flexible reference-to-target view generation, and temporal rollout. To support temporal rollout, we train with clean historical target-view tokens. We also add multi-view captions to enable test-time text control. Combined with an off-the-shelf 4D Gaussian Splatting stage, our framework lifts monocular static-camera videos into dynamic 4D Gaussian splats. Experiments on DNA-Rendering and ActorsHQ show that Flex4DHuman surpasses prior state-of-the-art methods, while the same formulation generalizes to animal categories after mixed human-animal training. These capabilities make Flex4DHuman a practical step toward scalable 4D content creation from casual monocular videos for simulation, gaming, AR/VR, and video re-shooting.

cs.CV↗

Area-minimizing capillary cones

We construct non-flat minimal capillary cones with bi-orthogonal symmetry groups for any dimension and contact angle. These cones interpolate between rescalings of a singular solution to the one-phase problem and the free-boundary cone obtained by halving a Lawson cone along a hyperplane of symmetry. The existence and uniqueness of such cones is proved by solving a nonlinear free boundary equation parametrized by the contact angle and obtaining monotonicity properties for the solutions. The constructed cones are minimizing in ambient dimension $8$ or higher, for appropriate contact angles, demonstrating that the regularity theory for minimizing capillary hypersurfaces can have singularities in codimension $7$ and completing the capillary regularity theory for contact angles near $π/2$. We further develop the connection between capillary hypersurfaces and solutions of the one-phase problem, consequently producing new examples of singular minimizing free boundaries for the Alt-Caffarelli functional.

math.DG↗

Stability inequalities for one-phase cones

We obtain strict stability inequalities for homogeneous solutions of the one-phase Bernoulli problem. We prove that in dimension $7$ and above, cohomogeneity one solutions with bi-orthogonal symmetry are strictly stable. As a consequence, we obtain a bound on the first eigenvalue and the decay rates of Jacobi fields, with applications to the generic regularity of the one-phase problem.

math.AP↗

The Tag is the Signal: URL-Agnostic Credibility Scoring for Messages on Telegram

Telegram has become one of the leading platforms for disseminating misinformational messages. However, many existing pipelines still classify each message's credibility based on the reputation of its associated domain names or its lexical features. Such methods work well on traditional long-form news articles published by well-known sources, but high-risk posts on Telegram are short and URL-sparse, leading to failures for link-based and standard TF-IDF models. To this end, we propose the TAG2CRED pipeline, a method designed for such short, convoluted messages. Our model will directly score each post based on the tags assigned to the text. We designed a concise label system that covers the dimensions of theme, claim type, call to action, and evidence. The fine-tuned large language model (LLM) assigns tags to messages and then maps these tags to calibrated risk scores in the [0,1] interval through L2-regularized logistic regression. We evaluated 87,936 Telegram messages associated with Media Bias/Fact Check (MBFC), using URL masking and domain disjoint splits. The results showed that the ROC-AUC of the TAG2CRED model reached 0.871, the macro-F1 value was 0.787, and the Brier score was 0.167, outperforming the baseline TF-IDF (macro-F1 value 0.737, Brier score 0.248); at the same time, the number of features used in this model is much smaller, and the generalization ability on infrequent domains is stronger. The performance of the stacked ensemble model (TF-IDF + TAG2CRED + SBERT) was further improved over the baseline SBERT. ROC-AUC reached 0.901, and the macro-F1 value was 0.813 (Brier score 0.114). This indicates that style labels and lexical features may capture different but complementary dimensions of information risk.

cs.SI↗