Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
19works
0followers
17topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

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

Published work

19 published item(s)

preprint2026arXiv

Beyond Accuracy: Evaluating Strategy Diversity in LLM Mathematical Reasoning

Large language models now achieve high final-answer accuracy on mathematical reasoning benchmarks, but accuracy alone does not capture reasoning flexibility. We introduce a strategy-level evaluation framework instantiated on 80 AMC 10/12 and AIME problems with 217 AoPS-derived reference strategy families. Model outputs are annotated for strategy identity, validity, and correctness using dual-AI coding with human adjudication. Across four frontier models, we find a pronounced decoupling between answer accuracy and strategy diversity. Under a single-solution prompt, all models achieve high accuracy (95%-100%), but under a multiple-strategy prompt they recover substantially fewer strategies than the human reference set. Gemini, DeepSeek, GPT, and Claude generate 184, 152, 151, and 110 distinct valid strategies, respectively, with the largest gaps in Geometry and Number Theory. The models collectively produce 50 benchmark-novel valid strategies, indicating both incomplete coverage of human strategies and some capacity for alternative reasoning. A repeated-run robustness check on 20 problems shows diminishing gains in discovered strategies, with the strongest model recovering only 39 of 55 AoPS-reference strategies (71%) after three runs. These findings position strategy diversity as a complementary dimension for evaluating mathematical reasoning beyond answer correctness.

preprint2022arXiv

Facial Reduction for Symmetry Reduced Semidefinite Doubly Nonnegative Programs

We consider both facial reduction, \FRp, and symmetry reduction, \SRp, techniques for semidefinite programming, \SDPp. We show that the two together fit surprisingly well in an alternating direction method of multipliers, \ADMMp, approach. In fact, this approach allows for simply adding on nonnegativity constraints, and solving the doubly nonnegative, \DNN, relaxation of many classes of hard combinatorial problems. We also show that the singularity degree remains the same after \SRp, and that the \DNN relaxations considered here have singularity degree one, that is reduced to zero after \FRp. The combination of \FR and \SR leads to a significant improvement in both numerical stability and running time for both the \ADMM and interior point approaches. We test our method on various \DNN relaxations of hard combinatorial problems including quadratic assignment problems with sizes of more than $n=500$. This translates to a semidefinite constraint of order $250,000$ and $625\times 10^8$ nonnegative constrained variables, before applying the reduction techniques.

preprint2022arXiv

On the Estimation Bias in Double Q-Learning

Double Q-learning is a classical method for reducing overestimation bias, which is caused by taking maximum estimated values in the Bellman operation. Its variants in the deep Q-learning paradigm have shown great promise in producing reliable value prediction and improving learning performance. However, as shown by prior work, double Q-learning is not fully unbiased and suffers from underestimation bias. In this paper, we show that such underestimation bias may lead to multiple non-optimal fixed points under an approximate Bellman operator. To address the concerns of converging to non-optimal stationary solutions, we propose a simple but effective approach as a partial fix for the underestimation bias in double Q-learning. This approach leverages an approximate dynamic programming to bound the target value. We extensively evaluate our proposed method in the Atari benchmark tasks and demonstrate its significant improvement over baseline algorithms.

preprint2022arXiv

On the Role of Discount Factor in Offline Reinforcement Learning

Offline reinforcement learning (RL) enables effective learning from previously collected data without exploration, which shows great promise in real-world applications when exploration is expensive or even infeasible. The discount factor, $γ$, plays a vital role in improving online RL sample efficiency and estimation accuracy, but the role of the discount factor in offline RL is not well explored. This paper examines two distinct effects of $γ$ in offline RL with theoretical analysis, namely the regularization effect and the pessimism effect. On the one hand, $γ$ is a regulator to trade-off optimality with sample efficiency upon existing offline techniques. On the other hand, lower guidance $γ$ can also be seen as a way of pessimism where we optimize the policy's performance in the worst possible models. We empirically verify the above theoretical observation with tabular MDPs and standard D4RL tasks. The results show that the discount factor plays an essential role in the performance of offline RL algorithms, both under small data regimes upon existing offline methods and in large data regimes without other conservative methods.

preprint2022arXiv

Robust Interior Point Method for Quantum Key Distribution Rate Computation

Security proof methods for quantum key distribution, QKD, that are based on the numerical key rate calculation problem, are powerful in principle. However, the practicality of the methods are limited by computational resources and the efficiency and accuracy of the underlying algorithms for convex optimization. We derive a stable reformulation of the convex nonlinear semidefinite programming, SDP, model for the key rate calculation problems. We use this to develop an efficient, accurate algorithm. The stable reformulation is based on novel forms of facial reduction, FR, for both the linear constraints and nonlinear quantum relative entropy objective function. This allows for a Gauss-Newton type interior-point approach that avoids the need for perturbations to obtain strict feasibility, a technique currently used in the literature. The result is high accuracy solutions with theoretically proven lower bounds for the original QKD from the FR stable reformulation. This provides novel contributions for FR for general SDP. We report on empirical results that dramatically improve on speed and accuracy, as well as solving previously intractable problems.

preprint2022arXiv

Universal Critical Behavior of Percolation in Orientationally Ordered Janus Particles and Other Anisotropic Systems

We combine percolation theory and Monte Carlo simulation to study in two dimensions the connectivity of an equilibrium lattice model of interacting Janus disks which self-assemble into an orientationally ordered stripe phase at low temperature. As the patch size is increased or the temperature is lowered, clusters of patch-connected disks grow, and a percolating cluster emerges at a threshold. In the stripe phase, the critical clusters extend longer in the direction parallel to the stripes than in the perpendicular direction, and percolation is thus anisotropic. It is found that the critical behavior of percolation in the Janus system is consistent with that of standard isotropic percolation, when an appropriate spatial rescaling is made. The rescaling procedure can be applied to understand other anisotropic systems, such as the percolation of aligned rigid rods and of the $q$-state Potts model with anisotropic interactions.

preprint2021arXiv

De Sitter braneworld and gravitational waves

We study the braneworld theory constructed by multi scalar fields. The model contains a smooth and infinitely large extra dimension, allowing the background fields propagating in it. We give a de Sitter solution for the four-dimensional cosmology as a good approximation to the early universe inflation. We show that the graviton has a localizable massless mode, and a series of continuous massive modes, separated by a mass gap. There could be a normalizable massive mode, depending on the background solution. The gravitational waves of massless mode evolve the same as the four dimensional theory, while that of the massive modes evolve greatly different from the massless mode.

preprint2021arXiv

Percolation thresholds of randomly rotating patchy particles on Archimedean lattices

We study the percolation of randomly rotating patchy particles on $11$ Archimedean lattices in two dimensions. Each vertex of the lattice is occupied by a particle, and in each model the patch size and number are monodisperse. When there are more than one patches on the surface of a particle, they are symmetrically decorated. As the proportion $χ$ of the particle surface covered by the patches increases, the clusters connected by the patches grow and the system percolates at the threshold $χ_c$. We combine Monte Carlo simulations and the critical polynomial method to give precise estimates of $χ_c$ for disks with one to six patches and spheres with one to two patches on the $11$ lattices. For one-patch particles, we find that the order of $χ_c$ values for particles on different lattices is the same as that of threshold values $p_c$ for site percolation on same lattices, which implies that $χ_c$ for one-patch particles mainly depends on the geometry of lattices. For particles with more patches, symmetry become very important in determining $χ_c$. With the estimates of $χ_c$ for disks with one to six patches, by analyses related to symmetry, we are able to give precise values of $χ_c$ for disks with an arbitrary number of patches on all $11$ lattices. The following rules are found for patchy disks on each of these lattices: (i) as the number of patches $n$ increases, values of $χ_c$ repeat in a periodic way, with the period $n_0$ determined by the symmetry of the lattice; (ii) when $\mod(n,n_0)=0$, the minimum threshold value $χ_{\rm min}$ appears, and the model is equivalent to site percolation with $χ_{\rm min}=p_c$; (iii) disks with $\mod(n,n_0)=m$ and $n_0-m$ ($m<n_0/2$) share the same $χ_c$ value.

preprint2020arXiv

Controlling Cherenkov threshold with nonlocality

Cherenkov radiation is generally believed to be threshold-free in hyperbolic metamaterials owing to the extremely large photonic density of states in classical local framework. While recent advances in nonlocal and quantum effects extend our understanding of light-matter interactions in metallic nanostructures, the influence of nonlocality on threshold-free Cherenkov radiation still remains elusive. Here we theoretically demonstrate that the nonlocality provides an indispensable way to flexibly engineer Cherenkov thresholds in metallodielectric layered structures. Particularly, the nonlocality results in a lower-bound velocity cutoff, whose value is comparable to the electron Fermi velocity. Surprisingly, this lower-bound threshold can be significantly smaller than the classically predicted one if the metamaterial works around epsilon-near-zero frequencies. The capability to control Cherenkov thresholds opens numerous prospects for practical applications of Cherenkov radiation, in particular, for integrated free-electron radiation sources.

preprint2020arXiv

Critical polynomials in the nonplanar and continuum percolation models

Exact or precise thresholds have been intensively studied since the introduction of the percolation model. Recently the critical polynomial $P_{\rm B}(p,L)$ was introduced for planar-lattice percolation models, where $p$ is the occupation probability and $L$ is the linear system size. The solution of $P_{\rm B} = 0$ can reproduce all known exact thresholds and leads to unprecedented estimates for thresholds of unsolved planar-lattice models. In two dimensions, assuming the universality of $P_{\rm B}$, we use it to study a nonplanar lattice model, i.e., the equivalent-neighbor lattice bond percolation, and the continuum percolation of identical penetrable disks, by Monte Carlo simulations and finite-size scaling analysis. It is found that, in comparison with other quantities, $P_{\rm B}$ suffers much less from finite-size corrections. As a result, we obtain a series of high-precision thresholds $p_c(z)$ as a function of coordination number $z$ for equivalent-neighbor percolation with $z$ up to O$(10^5)$, and clearly confirm the asymptotic behavior $zp_c-1 \sim 1/\sqrt{z}$ for $z \rightarrow \infty$. For the continuum percolation model, we surprisingly observe that the finite-size correction in $P_{\rm B}$ is unobservable within uncertainty O$(10^{-5})$ as long as $L \geq 3$. The estimated threshold number density of disks is $ρ_c = 1.436 325 05(10)$, slightly below the most recent result $ρ_c = 1.436 325 45(8)$ of Mertens and Moore obtained by other means. Our work suggests that the critical polynomial method can be a powerful tool for studying nonplanar and continuum systems in statistical mechanics.

preprint2020arXiv

GraftNet: An Engineering Implementation of CNN for Fine-grained Multi-label Task

Multi-label networks with branches are proved to perform well in both accuracy and speed, but lacks flexibility in providing dynamic extension onto new labels due to the low efficiency of re-work on annotating and training. For multi-label classification task, to cover new labels we need to annotate not only newly collected images, but also the previous whole dataset to check presence of these new labels. Also training on whole re-annotated dataset costs much time. In order to recognize new labels more effectively and accurately, we propose GraftNet, which is a customizable tree-like network with its trunk pretrained with a dynamic graph for generic feature extraction, and branches separately trained on sub-datasets with single label to improve accuracy. GraftNet could reduce cost, increase flexibility, and incrementally handle new labels. Experimental results show that it has good performance on our human attributes recognition task, which is fine-grained multi-label classification.

preprint2020arXiv

Linker-mediated self-assembly of mobile DNA-coated colloids

Developing construction methods of materials tailored for given applications with absolute control over building block placement poses an immense challenge. DNA-coated colloids offer the possibility of realising programmable self-assembly, which, in principle, can assemble almost any structure in equilibrium, but remains challenging experimentally. Here, we propose an innovative system of linker-mediated mobile DNA-coated colloids (mDNACCs), in which mDNACCs are bridged by the free DNA linkers in solution, whose two single-stranded DNA tails can bind with specific single-stranded DNA receptors of complementary sequence coated on colloids. We formulate a mean-field theory efficiently calculating the effective interaction between mDNACCs, where the entropy of DNA linkers plays a nontrivial role. Particularly, when the binding between free DNA linkers in solution and the corresponding receptors on mDNACCs is strong, the linker-mediated colloidal interaction is determined by the linker entropy depending on the linker concentration.

preprint2020arXiv

Self-controlled growth of highly uniform Ge/Si hut wires for scalable qubit devices

Semiconductor nanowires have been playing a crucial role in the development of nanoscale devices for the realization of spin qubits, Majorana fermions, single photon emitters, nanoprocessors, etc. The monolithic growth of site-controlled nanowires is a prerequisite towards the next generation of devices that will require addressability and scalability. Here, combining top-down nanofabrication and bottom-up self-assembly, we report on the growth of Ge wires on pre-patterned Si (001) substrates with controllable position, distance, length and structure. This is achieved by a novel growth process which uses a SiGe strain-relaxation template and can be generalized to other material combinations. Transport measurements show an electrically tunable spin-orbit coupling, with a spin-orbit length similar to that of III-V materials. Also, capacitive coupling between closely spaced wires is observed, which underlines their potential as a host for implementing two qubit gates. The reported results open a path towards scalable qubit devices with Si compatibility.

preprint2020arXiv

Stochastic inversion of Gaussian random media using transverse coherence functions for reflected waves

The transverse coherence functions (TCFs) of phase and amplitude fluctuations of a seismic wave are powerful to estimate the spatial distribution, length scales, and strength of random heterogeneities. However, TCFs have been formulated for transmitted waves only, not for reflected waves. In this paper, we derive reflection TCFs for Gaussian random media. Furthermore, we propose to invert for Gaussian random media using the reflection TCFs based on the grid search. We validate the new reflection TCF formulas using 2D finite-difference numerical experiments. The numerical example also illustrates the feasibility and efficiency of the inversion. The stochastic inversion using reflected waves can be used in both exploration and global seismology.

preprint2020arXiv

Stochasticity and heterogeneity in the transmission dynamics of SARS-CoV-2

SARS-CoV-2 causing COVID-19 disease has moved rapidly around the globe, infecting millions and killing hundreds of thousands. The basic reproduction number, which has been widely used and misused to characterize the transmissibility of the virus, hides the fact that transmission is stochastic, is dominated by a small number of individuals, and is driven by super-spreading events (SSEs). The distinct transmission features, such as high stochasticity under low prevalence, and the central role played by SSEs on transmission dynamics, should not be overlooked. Many explosive SSEs have occurred in indoor settings stoking the pandemic and shaping its spread, such as long-term care facilities, prisons, meat-packing plants, fish factories, cruise ships, family gatherings, parties and night clubs. These SSEs demonstrate the urgent need to understand routes of transmission, while posing an opportunity that outbreak can be effectively contained with targeted interventions to eliminate SSEs. Here, we describe the potential types of SSEs, how they influence transmission, and give recommendations for control of SARS-CoV-2.

preprint2020arXiv

Surface Dyakonov-Cherenkov Radiation

Recent advances in engineered material technologies (e.g., photonic crystals, metamaterials, plasmonics, etc) provide valuable tools to control Cherenkov radiation. In all these approaches, however, the designed materials interact only with the particle velocity to affect Cherenkov radiation, while the influence of the particle trajectory is generally negligible. Here, we report on surface Dyakonov-Cherenkov radiation, i.e. the emission of directional Dyakonov surface waves from a swift charged particle moving atop a birefringent crystal. This new type of Cherenkov radiation is highly susceptible to both the particle velocity and trajectory, e.g. we observe a sharp radiation enhancement when the particle trajectory falls in the vicinity of a particular direction. Moreover, close to the Cherenkov threshold, such a radiation enhancement can be orders of magnitude higher than that obtained in traditional Cherenkov detectors. These distinct properties allow us to determine simultaneously the magnitude and direction of particle velocities on a compact platform. The surface Dyakonov-Cherenkov radiation studied in this work not only adds a new degree of freedom for particle identification, but also provides an all-dielectric route to construct compact Cherenkov detectors with enhanced sensitivity.

preprint2020arXiv

The linearization problem of a binary quadratic problem and its applications

We provide several applications of the linearization problem of a binary quadratic problem. We propose a new lower bounding strategy, called the linearization-based scheme, that is based on a simple certificate for a quadratic function to be non-negative on the feasible set. Each linearization-based bound requires a set of linearizable matrices as an input. We prove that the Generalized Gilmore-Lawler bounding scheme for binary quadratic problems provides linearization-based bounds. Moreover, we show that the bound obtained from the first level reformulation linearization technique is also a type of linearization-based bound, which enables us to provide a comparison among mentioned bounds. However, the strongest linearization-based bound is the one that uses the full characterization of the set of linearizable matrices. Finally, we present a polynomial-time algorithm for the linearization problem of the quadratic shortest path problem on directed acyclic graphs. Our algorithm gives a complete characterization of the set of linearizable matrices for the quadratic shortest path problem.

preprint2018arXiv

Ultra-compact graphene plasmonic photodetector with the bandwidth over 110GHz

Graphene-based photodetectors, taking advantage of high carrier mobility and broadband absorption in graphene, have recently experienced rapid development. However, their performances with respect to the responsivity and bandwidth are still limited by either weak light-graphene interaction or large resistance-capacitance product. Here, we demonstrate a waveguide coupled integrated graphene plasmonic photodetector on the silicon-on-insulator platform. Benefiting from plasmonic enhanced graphene-light interactions and subwavelength confinement of the optical energy, we present a small-footprint graphene-plasmonic photodetector with bandwidth beyond 110GHz and intrinsic responsivity of 360mA/W. Attributed to the unique electronic bandstructure of graphene and its ultra-broadband absorption, the operational wavelength range extending beyond mid-infrared, and possibly further, can be anticipated. Our results show that the combination of graphene with plasmonic devices has great potential to realize ultra-compact and high-speed optoelectronic devices for graphene-based optical interconnects.