Source author record

David Liu

David Liu appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

12works
9topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

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

Published work

12 published item(s)

preprint2026arXiv

XTinyU-Net: Training-Free U-Net Scaling via Initialization-Time Sensitivity

While U-Net architectures remain the gold standard for medical image segmentation, their deployment in resource-constrained environments demands aggressive model compression. However, finding an optimally efficient configuration is computationally prohibitive, typically requiring exhaustive train-and-evaluate cycles to find the smallest model that maintains peak performance. In this paper, we introduce a training-free selection framework to automatically identify ultralightweight, dataset-specific U-Net configurations directly at initialization. We observe that systematically scaling down U-Net channel width induces a sharp transition from a stable performance plateau to representational capacity collapse. To pinpoint this boundary without training, we propose a Jacobian-based sensitivity metric that scores discrete, width-capped U-Net variants using a small set of unlabeled images. By analyzing the total variation of this sensitivity curve, we isolate the smallest stable configuration, which we denote as XTinyU-Net. Evaluated across six diverse medical datasets within the nnU-Net framework, XTinyU-Net achieves segmentation accuracy comparable to the heavy nnU-Net baseline with 400x-1600x fewer parameters, and outperforms contemporary lightweight architectures while utilizing 5x-72x fewer parameters. Code is publicly accessible on https://github.com/alvinkimbowa/nntinyunet.git.

preprint2022arXiv

Eye-gaze-guided Vision Transformer for Rectifying Shortcut Learning

Learning harmful shortcuts such as spurious correlations and biases prevents deep neural networks from learning the meaningful and useful representations, thus jeopardizing the generalizability and interpretability of the learned representation. The situation becomes even more serious in medical imaging, where the clinical data (e.g., MR images with pathology) are limited and scarce while the reliability, generalizability and transparency of the learned model are highly required. To address this problem, we propose to infuse human experts' intelligence and domain knowledge into the training of deep neural networks. The core idea is that we infuse the visual attention information from expert radiologists to proactively guide the deep model to focus on regions with potential pathology and avoid being trapped in learning harmful shortcuts. To do so, we propose a novel eye-gaze-guided vision transformer (EG-ViT) for diagnosis with limited medical image data. We mask the input image patches that are out of the radiologists' interest and add an additional residual connection in the last encoder layer of EG-ViT to maintain the correlations of all patches. The experiments on two public datasets of INbreast and SIIM-ACR demonstrate our EG-ViT model can effectively learn/transfer experts' domain knowledge and achieve much better performance than baselines. Meanwhile, it successfully rectifies the harmful shortcut learning and significantly improves the EG-ViT model's interpretability. In general, EG-ViT takes the advantages of both human expert's prior knowledge and the power of deep neural networks. This work opens new avenues for advancing current artificial intelligence paradigms by infusing human intelligence.

preprint2022arXiv

Identifying and Mitigating Instability in Embeddings of the Degenerate Core

Are the embeddings of a graph's degenerate core stable? What happens to the embeddings of nodes in the degenerate core as we systematically remove periphery nodes (by repeated peeling off $k$-cores)? We discover three patterns w.r.t. instability in degenerate-core embeddings across a variety of popular graph embedding algorithms and datasets. We use regression to quantify the change point in graph embedding stability. Furthermore, we present the STABLE algorithm, which takes an existing graph embedding algorithm and makes it stable. We show the effectiveness of STABLE in terms of making the degenerate-core embedding stable and still producing state-of-the-art link prediction performance.

preprint2020arXiv

Evolving Antennas for Ultra-High Energy Neutrino Detection

Evolutionary algorithms borrow from biology the concepts of mutation and selection in order to evolve optimized solutions to known problems. The GENETIS collaboration is developing genetic algorithms for designing antennas that are more sensitive to ultra-high energy neutrino induced radio pulses than current designs. There are three aspects of this investigation. The first is to evolve simple wire antennas to test the concept and different algorithms. Second, optimized antenna response patterns are evolved for a given array geometry. Finally, antennas themselves are evolved using neutrino sensitivity as a measure of fitness. This is achieved by integrating the XFdtd finite-difference time-domain modeling program with simulations of neutrino experiments.

preprint2016arXiv

Interaction-induced mode switching in steady-state microlasers

We demonstrate that due to strong modal interactions through cross-gain saturation, the onset of a new lasing mode can switch off an existing mode via a negative power slope. In this process of interaction-induced mode switching (IMS) the two involved modes maintain their identities, i.e. they do not change their spatial field patterns or lasing frequencies. For a fixed pump profile, a simple analytic criterion for the occurrence of IMS is given in terms of their self- and cross-interaction coefficients and non-interacting thresholds, which is verified for the example of a two-dimensional microdisk laser. When the spatial pump profile is varied as the pump power is increased, IMS can be induced even when it would not occur with a fixed pump profile, as we show for two coupled laser cavities. Our findings apply to steady-state lasing and are hence different from dynamical mode switching or hopping. IMS may have potential applications in robust and flexible all-optical switching.

preprint2015arXiv

Ab-initio multimode linewidth theory for arbitrary inhomogeneous laser cavities

We present a multimode laser-linewidth theory for arbitrary cavity structures and geometries that contains nearly all previously known effects and also finds new nonlinear and multimode corrections, e.g. a bad-cavity correction to the Henry $α$ factor and a multimode Schawlow--Townes relation (each linewidth is proportional to a sum of inverse powers of all lasing modes). Our theory produces a quantitatively accurate formula for the linewidth, with no free parameters, including the full spatial degrees of freedom of the system. Starting with the Maxwell--Bloch equations, we handle quantum and thermal noise by introducing random currents whose correlations are given by the fluctuation--dissipation theorem. We derive coupled-mode equations for the lasing-mode amplitudes and obtain a formula for the linewidths in terms of simple integrals over the steady-state lasing modes.

preprint2015arXiv

Human Curation and Convnets: Powering Item-to-Item Recommendations on Pinterest

This paper presents Pinterest Related Pins, an item-to-item recommendation system that combines collaborative filtering with content-based ranking. We demonstrate that signals derived from user curation, the activity of users organizing content, are highly effective when used in conjunction with content-based ranking. This paper also demonstrates the effectiveness of visual features, such as image or object representations learned from convnets, in improving the user engagement rate of our item-to-item recommendation system.

preprint2013arXiv

Pebbling Arguments for Tree Evaluation

The Tree Evaluation Problem was introduced by Cook et al. in 2010 as a candidate for separating P from L and NL. The most general space lower bounds known for the Tree Evaluation Problem require a semantic restriction on the branching programs and use a connection to well-known pebble games to generate a bottleneck argument. These bounds are met by corresponding upper bounds generated by natural implementations of optimal pebbling algorithms. In this paper we extend these ideas to a variety of restricted families of both deterministic and non-deterministic branching programs, proving tight lower bounds under these restricted models. We also survey and unify known lower bounds in our "pebbling argument" framework.

preprint2013arXiv

Transformation Inverse Design

We present a new technique for the design of transformation-optics devices based on large-scale optimization to achieve the optimal effective isotropic dielectric materials within prescribed index bounds, which is computationally cheap because transformation optics circumvents the need to solve Maxwell's equations at each step. We apply this technique to the design of multimode waveguide bends (realized experimentally in a previous paper) and mode squeezers, in which all modes are transported equally without scattering. In addition to the optimization, a key point is the identification of the correct boundary conditions to ensure reflectionless coupling to untransformed regions while allowing maximum flexibility in the optimization. Many previous authors in transformation optics used a certain kind of quasiconformal map which overconstrained the problem by requiring that the entire boundary shape be specified a priori while at the same time underconstraining the problem by employing "slipping" boundary conditions that permit unwanted interface reflections.

preprint2012arXiv

Syntactic Complexity of Finite/Cofinite, Definite, and Reverse Definite Languages

We study the syntactic complexity of finite/cofinite, definite and reverse definite languages. The syntactic complexity of a class of languages is defined as the maximal size of syntactic semigroups of languages from the class, taken as a function of the state complexity n of the languages. We prove that (n-1)! is a tight upper bound for finite/cofinite languages and that it can be reached only if the alphabet size is greater than or equal to (n-1)!-(n-2)!. We prove that the bound is also (n-1)! for reverse definite languages, but the minimal alphabet size is (n-1)!-2(n-2)!. We show that \lfloor e\cdot (n-1)!\rfloor is a lower bound on the syntactic complexity of definite languages, and conjecture that this is also an upper bound, and that the alphabet size required to meet this bound is \floor{e \cdot (n-1)!} - \floor{e \cdot (n-2)!}. We prove the conjecture for n\le 4.

preprint2012arXiv

Universal Witnesses for State Complexity of Basic Operations Combined with Reversal

We study the state complexity of boolean operations, concatenation and star with one or two of the argument languages reversed. We derive tight upper bounds for the symmetric differences and differences of such languages. We prove that the previously discovered bounds for union, intersection, concatenation and star of such languages can all be met by the recently introduced universal witnesses and their variants.

preprint2012arXiv

Universal Witnesses for State Complexity of Boolean Operations and Concatenation Combined with Star

We study the state complexity of boolean operations and product (concatenation, catenation) combined with star. We derive tight upper bounds for the symmetric differences and differences of two languages, one or both of which are starred, and for the product of two starred languages. We prove that the previously discovered bounds for the union and the intersection of languages with one or two starred arguments, for the product of two languages one of which is starred, and for the star of the product of two languages can all be met by the recently introduced universal witnesses and their variants.