Searcharxiv⌕ Search

arXiv subjects

Andrew Yang

Publications and source records attributed to Andrew Yang.

At least 19 recordsLinked to original sources

Pair distribution function oscillations at electrostatically stabilized nanocrystal surfaces reflect nanocrystal lattice periodicity

Nanocrystals (NCs) stabilized electrostatically by short, multivalent inorganic ligands exhibit rich interactions and phase behavior believed to hinge on the configuration of ions at the NC surface, yet these molecular details have not previously been measured. Here we use double-difference pair distribution functions (ddPDFs) of total X-ray scattering to determine the configuration of Sn$_2$S$_6^{4-}$ ligands on PbS NCs suspended in multivalent electrolyte. The measured ddPDFs exhibit a $\sim$3-$\mathring{\mathrm{A}}$ wavelength oscillation that extends $\sim$10 $\mathring{\mathrm{A}}$. Comparison with a PbS NC model decorated with Sn$_2$S$_6^{4-}$ ligands indicates ligands are aligned $\sim$radially, suggesting bidentate binding. Calculated partial PDFs show that the oscillatory signal is dominated by nanocrystal-Pb to ligand-Sn correlations. A simplified model that replaces the ligand with a strongly scattering Pt atom near the NC surface confirms the oscillation period in the ddPDF originates from the NC lattice constant. Nanocrystal lattice periodicity therefore merits consideration when interpreting ddPDFs of colloidal NCs.

cond-mat.mtrl-sci↗

Matching Markets: Equilibrium Computation, Indivisible Goods, and Positional Externalities

Matching markets provide a mathematical framework for allocating scarce resources among strategic agents with heterogeneous preferences. While matching without money relies on ordinal stability and Pareto efficiency, Fisher and Arrow--Debreu markets mediate allocation through budgets and market-clearing prices. In this paper, we study the convex-analytic foundations, computational complexity, and external-utility extensions of Fisher matching markets. First, we formulate fractional resource allocation and linear Fisher markets via Fenchel conjugate duality and the Karush--Kuhn--Tucker (KKT) conditions of the Eisenberg--Gale convex program, showing how budget-weighted Nash social welfare characterizes competitive equilibria across linear and homothetic utility families. Second, we review topological existence via Sperner's lemma alongside polynomial-time combinatorial algorithms for divisible markets, including the Devanur--Papadimitriou--Saberi--Vazirani (DPSV) primal-dual max-flow algorithm and Orlin's strongly polynomial scaling algorithm. Third, we contrast the tractability of divisible markets with the $\mathsf{NP}$-hardness and $\mathsf{PPAD}$-completeness of indivisible Fisher markets and Competitive Equilibrium from Equal Incomes (CEEI), comparing $\varepsilon$-approximate equilibria, CEEI-FRAC, and Budish's Approximate CEEI mechanism. Finally, we analyze Fisher markets with positional (snob-effect) externalities, where buyer $i$'s utility for good $j$ scales with her relative share $(x_{ij}/\sum_{k} x_{kj})^{α_i}$ for $α_i > 0$. We prove that positional utility summands are convex on the nonnegative orthant, so utilitarian social welfare is maximized at exclusive corner allocations, whereas decentralized price-taking admits a unique budget-proportional equilibrium in single-good snob markets with a Price of Anarchy of $n^α$ among $n$ symmetric buyers.

cs.GT↗

Zepp: Accelerating Distributed MoE Serving under Relaxed Balance Constraints

As Mixture-of-Experts (MoE) models continue to scale, serving them increasingly relies on expert parallelism (EP) across a growing number of devices. Yet skewed expert workloads create imbalance across computation, communication, and memory, making load balancing a central optimization objective in distributed MoE serving. We observe that balance is not free: operations introduced to balance one dimension can themselves be expensive or imbalanced. This motivates us to rethink balance as a constraint rather than an optimization objective. We present Zepp, which directly optimizes the bottleneck communication in distributed MoE serving subject to simplified balance constraints on physical resources, i.e., GPUs and NICs. Zepp progressively optimizes inter-node communication across placement, routing, and execution. It first places expert replicas to reduce token communication under GPU constraints, then reshapes communication flows through split and merge primitives under NIC constraints, and finally partitions and schedules ex- pert computation to overlap the resulting communication. To adapt to dynamic workloads, Zepp jointly coordinates computation, token communication, and expert-weight movement at each iteration. Together, these designs allow Zepp to pursue the most efficient execution rather than a single-dimension balanced one. We implement Zepp and evaluate it against 7 state-of-the-art MoE serving systems, achieving up to 6.68$\times$ MoE layer speedup and a geometric mean speedup of 1.86$\times$ over the fastest competing baseline.

cs.DC↗

Inter-Stance: A Dyadic Multimodal Corpus for Conversational Stance Analysis

Social interactions dominate our perceptions of the world and shape our daily behavior by attaching social meaning to acts as simple and spontaneous as gestures, facial expressions, voice, and speech. People mimic and otherwise respond to each other's postures, facial expressions, mannerisms, and other verbal and nonverbal behavior, and form appraisals or evaluations in the process. Yet, no publicly-available dataset includes multimodal recordings and self-report measures of multiple persons in social interaction. Dyadic recordings and annotation are lacking. We present a new data corpus of multimodal dyadic interaction (45 dyads, 90 persons) that includes synchronized multi-modality behavior (2D face video, 3D face geometry, thermal spectrum dynamics, voice and speech behavior, physiology (PPG, EDA, heart-rate, blood pressure, and respiration), and self-reported affect of all participants in a communicative interaction scenario. Two types of dyads are included: persons with shared past history and strangers. Annotations include social signals, agreement, disagreement, and neutral stance. With a potent emotion induction, these multimodal data will enable novel modeling of multimodal interpersonal behavior. We present extensive experiments to evaluate multimodal dyadic communication of dyads with and without interpersonal history, and their affect. This new database will make multimodal modeling of social interaction never possible before. The dataset includes 20TB of multimodal data to share with the research community.

cs.CV↗

Hierarchical Mesh Transformers with Topology-Guided Pretraining for Morphometric Analysis of Brain Structures

Representation learning on large-scale unstructured volumetric and surface meshes poses significant challenges in neuroimaging, especially when models must incorporate diverse vertex-level morphometric descriptors, such as cortical thickness, curvature, sulcal depth, and myelin content, which carry subtle disease-related signals. Current approaches either ignore these clinically informative features or support only a single mesh topology, restricting their use across imaging pipelines. We introduce a hierarchical transformer framework designed for heterogeneous mesh analysis that operates on spatially adaptive tree partitions constructed from simplicial complexes of arbitrary order. This design accommodates both volumetric and surface discretizations within a single architecture, enabling efficient multi-scale attention without topology-specific modifications. A feature projection module maps variable-length per-vertex clinical descriptors into the spatial hierarchy, separating geometric structure from feature dimensionality and allowing seamless integration of different neuroimaging feature sets. Self-supervised pretraining via masked reconstruction of both coordinates and morphometric channels on large unlabeled cohorts yields a transferable encoder backbone applicable to diverse downstream tasks and mesh modalities. We validate our approach on Alzheimer's disease classification and amyloid burden prediction using volumetric brain meshes from ADNI, as well as focal cortical dysplasia detection on cortical surface meshes from the MELD dataset, achieving state-of-the-art results across all benchmarks.

cs.CV↗

Zero-free regions inspired by work of Heath-Brown

We prove a new explicit zero-free region for the Riemann zeta-function, drawing substantially on Heath-Brown's seminal work on Linnik's constant. Using these ideas we are able to prove that $ζ(σ+ it)\ne 0$ whenever $t\geq 3$ and $σ\geq 1- 1/(4.896\log t)$.

math.NT↗

diffpy.morph: Python tools for model independent comparisons between sets of 1D functions

diffpy$.$morph addresses a need to gain scientific insights from 1D scientific spectra in model independent ways. A powerful approach for this is to take differences between pairs of spectra and look for meaningful changes that might indicate underlying chemical, structural, or other modifications. The challenge is that the difference curve may contain uninteresting differences such as experimental inconsistencies and benign physical changes such as the effects of thermal expansion. diffpy$.$morph allows researchers to apply simple transformations, or "morphs", to one of the datasets to remove the unwanted differences revealing, when they are present, non-trivial differences. diffpy$.$morph is an open-source Python package available on the Python Package Index and conda-forge. Here, we describe its functionality and apply it to solve a range of experimental challenges on diffraction and PDF data from x-rays and neutrons, though we note that it may be applied to any 1D function in principle.

physics.comp-ph↗

A complete formalization of Fermat's Last Theorem for regular primes in Lean

We formalize a complete proof of the regular case of Fermat's Last Theorem in the Lean4 theorem prover. Our formalization includes a proof of Kummer's lemma, that is the main obstruction to Fermat's Last Theorem for regular primes. Rather than following the modern proof of Kummer's lemma via class field theory, we prove it by using Hilbert's Theorems 90-94 in a way that is more amenable to formalization.

cs.FL↗

An Absorption Correction for Reliable Pair-Distribution Functions from Low Energy X-ray Sources

This paper explores the development and testing of a simple absorption correction model for processing x-ray powder diffraction data from Debye-Scherrer geometry laboratory x-ray experiments. This may be used as a pre-processing step before using PDFgetX3 to obtain reliable pair distribution functions (PDFs). The correction was found to depend only on muD, the product of the x-ray attenuation coefficient and capillary diameter. Various experimental and theoretical methods for estimating muD were explored, and the most appropriate muD values for correction were identified for different capillary diameters and x-ray beam sizes. We identify operational ranges of muD where reasonable signal to noise is possible after correction. A user-friendly software package, diffpy.labpdfproc, is presented that can help estimate muD and perform absorption corrections, with a rapid calculation for efficient processing.

cond-mat.mtrl-sci↗

New exponent pairs, zero density estimates, and zero additive energy estimates: a systematic approach

We obtain several new bounds on exponents of interest in analytic number theory, including four new exponent pairs, new zero density estimates for the Riemann zeta-function, and new estimates for the additive energy of zeroes of the Riemann zeta-function. These results were obtained by creating the Analytic Number Theory Exponent Database (ANTEDB) to collect results and relationships between these exponents, and then systematically optimising these relationships to obtain the new bounds. We welcome further contributions to the database, which aims to allow easy conversion of new bounds on these exponents into optimised bounds on other related exponents of interest.

math.NT↗

Toward optimal exponent pairs

We quantify the set of known exponent pairs $(k, \ell)$ and develop a framework to compute the optimal exponent pair for an arbitrary objective function. Applying this methodology, we make progress on several open problems, including bounds of the Riemann zeta-function $ζ(s)$ in the critical strip, estimates of the moments of $ζ(1/2 + it)$ and the generalised Dirichlet divisor problem.

math.NT↗

Applications of Moments of Dirichlet Coefficients in Elliptic Curve Families

The moments of the coefficients of elliptic curve L-functions are related to numerous arithmetic problems. Rosen and Silverman proved a conjecture of Nagao relating the first moment of one-parameter families satisfying Tate's conjecture to the rank of the corresponding elliptic surface over Q(T); one can also construct families of moderate rank by finding families with large first moments. Michel proved that if j(T) is not constant, then the second moment of the family is of size p^2 + O(p^(3/2)); these two moments show that for suitably small support the behavior of zeros near the central point agree with that of eigenvalues from random matrix ensembles, with the higher moments impacting the rate of convergence. In his thesis, Miller noticed a negative bias in the second moment of every one-parameter family of elliptic curves over the rationals whose second moment had a calculable closed-form expression, specifically the first lower order term which does not average to zero is on average negative. This Bias Conjecture is confirmed for many families; however, these are highly non-generic families whose resulting Legendre sums can be determined. Inspired by the recent successes by Yang-Hui He, Kyu-Hwan Lee, Thomas Oliver, Alexey Pozdnyakov and others in investigations of murmurations of elliptic curve coefficients with machine learning techniques, we pose a similar problem for trying to understand the Bias Conjecture. As a start to this program, we numerically investigate the Bias Conjecture for a family whose bias is positive for half the primes. Since the numerics do not offer conclusive evidence that negative bias for the other half is enough to overwhelm the positive bias, the Bias Conjecture cannot be verified for the family.

math.NT↗

AugLoss: A Robust Augmentation-based Fine Tuning Methodology

Deep Learning (DL) models achieve great successes in many domains. However, DL models increasingly face safety and robustness concerns, including noisy labeling in the training stage and feature distribution shifts in the testing stage. Previous works made significant progress in addressing these problems, but the focus has largely been on developing solutions for only one problem at a time. For example, recent work has argued for the use of tunable robust loss functions to mitigate label noise, and data augmentation (e.g., AugMix) to combat distribution shifts. As a step towards addressing both problems simultaneously, we introduce AugLoss, a simple but effective methodology that achieves robustness against both train-time noisy labeling and test-time feature distribution shifts by unifying data augmentation and robust loss functions. We conduct comprehensive experiments in varied settings of real-world dataset corruption to showcase the gains achieved by AugLoss compared to previous state-of-the-art methods. Lastly, we hope this work will open new directions for designing more robust and reliable DL models under real-world corruptions.

cs.LG↗

Explicit bounds on $ζ(s)$ in the critical strip and a zero-free region

We derive explicit upper bounds for the Riemann zeta-function $ζ(σ+ it)$ on the lines $σ= 1 - k/(2^k - 2)$ for integer $k \ge 4$. This is used to show that the zeta-function has no zeroes in the region $$σ> 1 - \frac{\log\log|t|}{21.233\log|t|},\qquad |t| \ge 3.$$ This is the largest known zero-free region for $\exp(171) \le t \le \exp(5.3\cdot 10^{5})$. Our results rely on an explicit version of the van der Corput $A^nB$ process for bounding exponential sums.

math.NT↗

Long-time instability of planar Poiseuille-type flow in compressible fluid

It is well-known that at the high Reynolds number, the linearized Navier-Stokes equations around the inviscid stable shear profile admit growing mode solutions due to the destabilizing effect of the viscosity. This phenomenon, called Tollmien-Schlichting instability, has been rigorously justified by Grenier-Guo-Nguyen [Adv. Math. 292 (2016); Duke J. Math. 165 (2016)] for Poiseuille flows and boundary layers in the incompressible fluid. To reveal this intrinsic instability mechanism in the compressible setting, in this paper, we study the long-time instability of the Poiseuille flow in a channel. Note that this instability arises in a low-frequency regime instead of a high-frequency regime for the Prandtl boundary layer. The proof is based on the quasi-compressible-Stokes iteration introduced by Yang-Zhang in [50] and subtle analysis of the dispersion relation for the instability. Note that we do not require symmetric conditions on the background shear flow or perturbations.

math.AP↗

On the generalised Dirichlet divisor problem

We improve unconditional estimates on $Δ_k(x)$, the remainder term of the generalised divisor function, for large $k$. In particular, we show that $Δ_k(x) \ll x^{1 - 1.889k^{-2/3}}$ for all sufficiently large fixed $k$.

math.NT↗

An explicit sub-Weyl bound for $ζ(1/2 + it)$

In this article we prove an explicit sub-Weyl bound for the Riemann zeta function $ζ(s)$ on the critical line $s = 1/2 + it$. In particular, we show that $|ζ(1/2 + it)| \le 66.7\, t^{27/164}$ for $t \ge 3$. Combined, our results form the sharpest known bounds on $ζ(1/2 + it)$ for $t \ge \exp(61)$.

math.NT↗