SearcharxivSearch

arXiv subjects

Jinshan Zhang

Publications and source records attributed to Jinshan Zhang.

At least 19 recordsLinked to original sources

AST: Adaptive, Seamless, and Training-Free Precise Speech Editing

Text-based speech editing aims to modify specific segments while preserving speaker identity and acoustic context. Current approaches generally involve either expensive task-specific training or adapting pre-trained Text-to-Speech (TTS) models. However, both paradigms face challenges: task-specific methods often degrade fidelity in unedited regions, whereas TTS adaptations struggle with a trade-off between editing naturalness and temporal fidelity. To address these issues, we propose AST, an Adaptive, Seamless, and Training-free speech editing framework. Built upon pre-trained TTS, AST leverages Latent Recomposition to stitch preserved source segments with synthesized targets, guaranteeing fidelity in unedited regions. To break the quality-controllability trade-off, we introduce Adaptive Weak Fact Guidance (AWFG), which modulates a mel-space signal to ensure seamless boundary transitions without disrupting the generative manifold. Furthermore, to address evaluation gaps in temporal fidelity, we propose a new benchmark suite: the LibriSpeech-Edit dataset and a novel metric, Word-level Dynamic Time Warping (WDTW). Extensive experiments demonstrate that AST consistently outperforms existing task-specific and fine-tuned speech editing methods across content accuracy, perceptual quality, speaker preservation, and temporal fidelity. Remarkably, AST achieves state-of-the-art zero-shot speech editing performance without any task-specific training or paired editing data, validating the effectiveness of latent recomposition and AWFG in bridging the quality-controllability trade-off.

cs.SD

Soul Computing: A Theoretical Framework and Technical Architecture for Intelligent Agents with Independent Consciousness

Breakthroughs in large language models and multimodal generation technologies have propelled the digital reconstruction of human mental traits, emotional patterns, and long-term memory from science fiction toward engineering practice. Yet current research and industry practices at the intersection of AI and digital humans remain hampered by fundamental conceptual ambiguities: the essential differences between next-generation intelligent agents and traditional virtual humans, the construction pathways for digital entities possessing self-identity, and the core technical and ethical challenges confronting this domain all demand urgent clarification. This paper systematically examines the transformative logic underlying the transition from traditional virtual humans to the ``Soul Computing'' paradigm, driven by frontier AI technologies. We first analyze the evolutionary patterns of human consciousness and memory mechanisms, reassessing the core value of massive multimodal digital fragments in the reverse reconstruction of individual mental worlds. On this basis, we formally delineate the academic connotations of narrow and broad Soul Computing for the first time, clarifying its academic boundaries and essential distinctions from Affective Computing, Historical Reconstruction, and Mortal Computation. We argue that Soul Computing systems must architecturally construct an ``Intensional'' core rather than serving as purely ``Extensional'' functional carriers, thereby enabling the fundamental transition of AI from toolhood to living agency.

cs.AI

OmniEdit: A Training-free framework for Lip Synchronization and Audio-Visual Editing

Lip synchronization and audio-visual editing have emerged as fundamental challenges in multimodal learning, underpinning a wide range of applications, including film production, virtual avatars, and telepresence. Despite recent progress, most existing methods for lip synchronization and audio-visual editing depend on supervised fine-tuning of pre-trained models, leading to considerable computational overhead and data requirements. In this paper, we present OmniEdit, a training-free framework designed for both lip synchronization and audio-visual editing. Our approach reformulates the editing paradigm by substituting the edit sequence in FlowEdit with the target sequence, yielding an unbiased estimation of the desired output. Moreover, by removing stochastic elements from the generation process, we establish a smooth and stable editing trajectory. Extensive experimental results validate the effectiveness and robustness of the proposed framework. Code is available at https://github.com/l1346792580123/OmniEdit.

cs.CV

Low-energy spin dynamics in a Kitaev material Na3Ni2BiO6 investigated by NMR

We performed 23Na NMR and magnetization measurements on an S = 1, quasi-2D honeycomb lattice antiferromagnet Na3Ni2BiO6. A large positive Curie-Weiss constant of 22.9 K is observed. The NMR spectra at low fields are consistent with a "zigzag" magnetic order, indicating a large easy-axis anisotropy. With field applied along the c* axis, the NMR spectra confirm the existence of a 1/3-magnetization plateau phase between 5.1 T and 7.1 T. The transition from the zigzag order to the 1/3-magnetization plateau phase is also found to be a first-order type. A monotonic decrease of the spin gap is revealed in the 1/3-magnetization plateau phase, which reaches zero at a quantum critical field Hc = 8.35 T before entering the fully polarized phase. These data suggest the existence of exchange frustration in the system along with strong ferromagnetic interactions, hosting the possibility for Kitaev physics. Besides, well below the ordered phase, the 1/T1 at high fields shows either a level off or an enhancement upon cooling below 3 K, which suggests the existence of low-energy fluctuations.

cond-mat.str-el

Near-Optimal Experimental Design Under the Budget Constraint in Online Platforms

A/B testing, or controlled experiments, is the gold standard approach to causally compare the performance of algorithms on online platforms. However, conventional Bernoulli randomization in A/B testing faces many challenges such as spillover and carryover effects. Our study focuses on another challenge, especially for A/B testing on two-sided platforms -- budget constraints. Buyers on two-sided platforms often have limited budgets, where the conventional A/B testing may be infeasible to be applied, partly because two variants of allocation algorithms may conflict and lead some buyers to exceed their budgets if they are implemented simultaneously. We develop a model to describe two-sided platforms where buyers have limited budgets. We then provide an optimal experimental design that guarantees small bias and minimum variance. Bias is lower when there is more budget and a higher supply-demand rate. We test our experimental design on both synthetic data and real-world data, which verifies the theoretical results and shows our advantage compared to Bernoulli randomization.

cs.LG

Pressure-induced superconductivity in flat-band Kagome compounds Pd$_3$P$_2$(S$_{1-x}$Se$_x$)$_8$

We performed high-pressure transport studies on the flat-band Kagome compounds, Pd$_3$P$_2$(S$_{1-x}$Se$_x$)$_8$ ($x$ = 0, 0.25), with a diamond anvil cell. For both compounds, the resistivity exhibits an insulating behavior with pressure up to 17 GPa. With pressure above 20 GPa, a metallic behavior is observed at high temperatures in Pd$_3$P$_2$S$_8$, and superconductivity emerges at low temperatures. The onset temperature of superconducting transition $T_{\rm C}$ rises monotonically from 2 K to 4.8 K and does not saturate with pressure up to 43 GPa. For the Se-doped compound Pd$_3$P$_2$(S$_{0.75}$Se$_{0.25}$)$_8$, the $T_{\rm C}$ is about 1.5 K higher than that of the undoped one over the whole pressure range, and reaches 6.4 K at 43 GPa. The upper critical field with field applied along the $c$ axis at typical pressures is about 50$\%$ of the Pauli limit, suggesting a 3D superconductivity. The Hall coefficient in the metallic phase is low and exhibits a peaked behavior at about 30 K, which suggests either a multi-band electronic structure or an electron correlation effect in the system.

cond-mat.supr-con

No-regret Learning in Repeated First-Price Auctions with Budget Constraints

Recently the online advertising market has exhibited a gradual shift from second-price auctions to first-price auctions. Although there has been a line of works concerning online bidding strategies in first-price auctions, it still remains open how to handle budget constraints in the problem. In the present paper, we initiate the study for a buyer with budgets to learn online bidding strategies in repeated first-price auctions. We propose an RL-based bidding algorithm against the optimal non-anticipating strategy under stationary competition. Our algorithm obtains $\widetilde O(\sqrt T)$-regret if the bids are all revealed at the end of each round. With the restriction that the buyer only sees the winning bid after each round, our modified algorithm obtains $\widetilde O(T^{\frac{7}{12}})$-regret by techniques developed from survival analysis. Our analysis extends to the more general scenario where the buyer has any bounded instantaneous utility function with regrets of the same order.

cs.GT

Size versus truthfulness in the House Allocation problem

We study the House Allocation problem (also known as the Assignment problem), i.e., the problem of allocating a set of objects among a set of agents, where each agent has ordinal preferences (possibly involving ties) over a subset of the objects. We focus on truthful mechanisms without monetary transfers for finding large Pareto optimal matchings. It is straightforward to show that no deterministic truthful mechanism can approximate a maximum cardinality Pareto optimal matching with ratio better than 2. We thus consider randomised mechanisms. We give a natural and explicit extension of the classical Random Serial Dictatorship Mechanism (RSDM) specifically for the House Allocation problem where preference lists can include ties. We thus obtain a universally truthful randomised mechanism for finding a Pareto optimal matching and show that it achieves an approximation ratio of $\frac{e}{e-1}$. The same bound holds even when agents have priorities (weights) and our goal is to find a maximum weight (as opposed to maximum cardinality) Pareto optimal matching. On the other hand we give a lower bound of $\frac{18}{13}$ on the approximation ratio of any universally truthful Pareto optimal mechanism in settings with strict preferences. In the case that the mechanism must additionally be non-bossy with an additional technical assumption, we show by utilising a result of Bade that an improved lower bound of $\frac{e}{e-1}$ holds. This lower bound is tight since RSDM for strict preference lists is non-bossy. We moreover interpret our problem in terms of the classical secretary problem and prove that our mechanism provides the best randomised strategy of the administrator who interviews the applicants.

cs.GT

NMR Evidence of Charge Fluctuations in Multiferroic CuBr2

We report combined magnetic susceptibility, dielectric constant, nuclear quadruple resonance (NQR) and zero-field nuclear magnetic resonance (NMR) measurements on single crystals of multiferroics CuBr$_2$. High quality of the sample is demonstrated by the sharp magnetic and magnetic-driven ferroelectric transition at $T_N=T_C\approx$ 74~K. The zero-field $^{79}$Br and $^{81}$Br NMR are resolved below $T_N$. The spin-lattice relaxation rates reveal charge fluctuations when cooled below 60~K. Evidences of an increase of NMR linewidth, a reduction of dielectric constant, and an increase of magnetic susceptibility are also seen at low temperatures. These data suggest an emergent instability which competes with the spiral magnetic ordering and the ferroelectricity. Candidate mechanisms are discussed based on the quasi-one-dimensional (1D) nature of the magnetic system.

cond-mat.str-el

Social Welfare in One-Sided Matching Mechanisms

We study the Price of Anarchy of mechanisms for the well-known problem of one-sided matching, or house allocation, with respect to the social welfare objective. We consider both ordinal mechanisms, where agents submit preference lists over the items, and cardinal mechanisms, where agents may submit numerical values for the items being allocated. We present a general lower bound of $Ω(\sqrt{n})$ on the Price of Anarchy, which applies to all mechanisms. We show that two well-known mechanisms, Probabilistic Serial, and Random Priority, achieve a matching upper bound. We extend our lower bound to the Price of Stability of a large class of mechanisms that satisfy a common proportionality property, and show stronger bounds on the Price of Anarchy of all deterministic mechanisms.

cs.GT

On Revenue Maximization with Sharp Multi-Unit Demands

We consider markets consisting of a set of indivisible items, and buyers that have {\em sharp} multi-unit demand. This means that each buyer $i$ wants a specific number $d_i$ of items; a bundle of size less than $d_i$ has no value, while a bundle of size greater than $d_i$ is worth no more than the most valued $d_i$ items (valuations being additive). We consider the objective of setting prices and allocations in order to maximize the total revenue of the market maker. The pricing problem with sharp multi-unit demand buyers has a number of properties that the unit-demand model does not possess, and is an important question in algorithmic pricing. We consider the problem of computing a revenue maximizing solution for two solution concepts: competitive equilibrium and envy-free pricing. For unrestricted valuations, these problems are NP-complete; we focus on a realistic special case of "correlated values" where each buyer $i$ has a valuation $v_i\qual_j$ for item $j$, where $v_i$ and $\qual_j$ are positive quantities associated with buyer $i$ and item $j$ respectively. We present a polynomial time algorithm to solve the revenue-maximizing competitive equilibrium problem. For envy-free pricing, if the demand of each buyer is bounded by a constant, a revenue maximizing solution can be found efficiently; the general demand case is shown to be NP-hard.

cs.GT

Pricing Ad Slots with Consecutive Multi-unit Demand

We consider the optimal pricing problem for a model of the rich media advertisement market, as well as other related applications. In this market, there are multiple buyers (advertisers), and items (slots) that are arranged in a line such as a banner on a website. Each buyer desires a particular number of {\em consecutive} slots and has a per-unit-quality value $v_i$ (dependent on the ad only) while each slot $j$ has a quality $q_j$ (dependent on the position only such as click-through rate in position auctions). Hence, the valuation of the buyer $i$ for item $j$ is $v_iq_j$. We want to decide the allocations and the prices in order to maximize the total revenue of the market maker. A key difference from the traditional position auction is the advertiser's requirement of a fixed number of consecutive slots. Consecutive slots may be needed for a large size rich media ad. We study three major pricing mechanisms, the Bayesian pricing model, the maximum revenue market equilibrium model and an envy-free solution model. Under the Bayesian model, we design a polynomial time computable truthful mechanism which is optimum in revenue. For the market equilibrium paradigm, we find a polynomial time algorithm to obtain the maximum revenue market equilibrium solution. In envy-free settings, an optimal solution is presented when the buyers have the same demand for the number of consecutive slots. We conduct a simulation that compares the revenues from the above schemes and gives convincing results.

cs.GT

Approximating Partition Functions of Two-State Spin Systems

Two-state spin systems is a classical topic in statistical physics. We consider the problem of computing the partition function of the systems on a bounded degree graph. Based on the self-avoiding tree, we prove the systems exhibits strong correlation decay under the condition that the absolute value of "inverse temperature" is small. Due to strong correlation decay property, an FPTAS for the partition function is presented under the same condition. This condition is sharp for Ising model.

cs.DM

Strong Spatial Mixing for Binary Markov Random Fields

Gibbs distribution of binary Markov random fields on a sparse on average graph is considered in this paper. The strong spatial mixing is proved under the condition that the `external field' is uniformly large or small. Such condition on `external field' is meaningful in physics.

cs.IT

Improved Approximation for the Number of Hamiltonian Cycles in Dense Digraphs

We propose an improved algorithm for counting the number of Hamiltonian cycles in a directed graph. The basic idea of the method is sequential acceptance/rejection, which is successfully used in approximating the number of perfect matchings in dense bipartite graphs. As a consequence, a new bound on the number of Hamiltonian cycles in a directed graph is proved, by using the ratio of the number of 1-factors. Based on this bound, we prove that our algorithm runs in expected time of $O(n^{8.5})$ for dense problems. This improves the Markov chain method, the most powerful existing method, a factor of at least $n^{4.5}(\log n)^{4}$ in running time. This class of dense problems is shown to be nontrivial in counting, in the sense that it is $#$P-Complete.

cs.DS

Strong Spatial Mixing and Approximating Partition Functions of Two-State Spin Systems without Hard Constrains

We prove Gibbs distribution of two-state spin systems(also known as binary Markov random fields) without hard constrains on a tree exhibits strong spatial mixing(also known as strong correlation decay), under the assumption that, for arbitrary `external field', the absolute value of `inverse temperature' is small, or the `external field' is uniformly large or small. The first condition on `inverse temperature' is tight if the distribution is restricted to ferromagnetic or antiferromagnetic Ising models. Thanks to Weitz's self-avoiding tree, we extends the result for sparse on average graphs, which generalizes part of the recent work of Mossel and Sly\cite{MS08}, who proved the strong spatial mixing property for ferromagnetic Ising model. Our proof yields a different approach, carefully exploiting the monotonicity of local recursion. To our best knowledge, the second condition of `external field' for strong spatial mixing in this paper is first considered and stated in term of `maximum average degree' and `interaction energy'. As an application, we present an FPTAS for partition functions of two-state spin models without hard constrains under the above assumptions in a general family of graphs including interesting bounded degree graphs.

cs.DM

Constituting Atoms of a $σ$ Algebra via Its Generator

To constitute atoms of a $σ$ algebra is not a easy task due to the large number of its elements. However, determining them via generators seems a feasible and simple way since most $σ$ algebras are generated by their smaller proper subsets. Precisely, under some conditions each atom of a $σ$ algebra equals the intersection of the elements containing a point of the atom in the generator. In this paper, a very weak sufficient condition for determining atoms by the generator is presented. The condition, though not being a necessary one, is shown to be almost the weakest one in the sense that it can hardly be improved.

math.PR

Lecture notes on "Combinatorial Criteria for Uniqueness of Gibbs Measures"

These notes are dedicated to whom may be interested in algorithms, Markov chain, coupling, and graph theory etc. I present some preliminaries on coupling and explanations of the important formulas or phrases, which may be helpful for us to understand D. Weitz's paper "Combinatorial Criteria for Uniqueness of Gibbs Measures" with ease.

math-ph