Searcharxiv⌕ Search

arXiv subjects

Andreas Fischer

Publications and source records attributed to Andreas Fischer.

At least 55 records · Page 3Linked to original sources

Self-Rule to Multi-Adapt: Generalized Multi-source Feature Learning Using Unsupervised Domain Adaptation for Colorectal Cancer Tissue Detection

Supervised learning is constrained by the availability of labeled data, which are especially expensive to acquire in the field of digital pathology. Making use of open-source data for pre-training or using domain adaptation can be a way to overcome this issue. However, pre-trained networks often fail to generalize to new test domains that are not distributed identically due to tissue stainings, types, and textures variations. Additionally, current domain adaptation methods mainly rely on fully-labeled source datasets. In this work, we propose Self-Rule to Multi-Adapt (SRMA), which takes advantage of self-supervised learning to perform domain adaptation, and removes the necessity of fully-labeled source datasets. SRMA can effectively transfer the discriminative knowledge obtained from a few labeled source domain's data to a new target domain without requiring additional tissue annotations. Our method harnesses both domains' structures by capturing visual similarity with intra-domain and cross-domain self-supervision. Moreover, we present a generalized formulation of our approach that allows the framework to learn from multiple source domains. We show that our proposed method outperforms baselines for domain adaptation of colorectal tissue type classification \new{in single and multi-source settings}, and further validate our approach on an in-house clinical cohort. The code and trained models are available open-source: https://github.com/christianabbet/SRA.

cs.CV↗

Hunting active Brownian particles: Learning optimal behavior

We numerically study active Brownian particles that can respond to environmental cues through a small set of actions (switching their motility and turning left or right with respect to some direction) which are motivated by recent experiments with colloidal self-propelled Janus particles. We employ reinforcement learning to find optimal mappings between the state of particles and these actions. Specifically, we first consider a predator-prey situation in which prey particles try to avoid a predator. Using as reward the squared distance from the predator, we discuss the merits of three state-action sets and show that turning away from the predator is the most successful strategy. We then remove the predator and employ as collective reward the local concentration of signaling molecules exuded by all particles and show that aligning with the concentration gradient leads to chemotactic collapse into a single cluster. Our results illustrate a promising route to obtain local interaction rules and design collective states in active matter.

cond-mat.soft↗

Computational Homogenization of Concrete in the Cyber Size-Resolution-Discretization (SRD) Parameter Space

Micro- and mesostructures of multiphase materials obtained from tomography and image acquisition are an ever more important database for simulation analyses. Huge data sets for reconstructed 3d volumes typically as voxel grids call for criteria and measures to find an affordable balance of accuracy and efficiency. The present work shows for a 3d mesostructure of concrete in the elastic deformation range, how the computational complexity in analyses of numerical homogenization can be reduced at controlled errors. Reduction is systematically applied to specimen size S, resolution R, and discretization D, which span the newly introduced SRD parameter space. Key indicators for accuracy are (i) the phase fractions, (ii) the homogenized elasticity tensor, (iii) its invariance with respect to the applied boundary conditions and (iv) the total error as well as spatial error distributions, which are computed and estimated. Pre-analyses in the 2d SRD parameter sub-space explore the transferability to the 3d case. Beyond the concrete specimen undergoing elastic deformations in the present work, the proposed concept enables accuracy-efficiency balances for various classes of heterogeneous materials in different deformation regimes and thus contributes to build comprehensive digital twins of materials with validated attributes.

cs.CE↗

Transport Services: A Modern API for an Adaptive Internet Transport Layer

Transport services (TAPS) is a working group of the Internet's standardization body, the Internet Engineering Task Force (IETF). TAPS defines a new recommended API for the Internet's transport layer. This API gives access to a wide variety of services from various protocols, and it is protocol-independent: the transport layer becomes adaptive, and applications are no longer statically bound to a particular protocol and/or network interface. We give an overview of the TAPS API, and we demonstrate its flexibility and ease of use with an example using a Python-based open-source implementation.

cs.NI↗

Kinetic approach to the nuclear-spin polaron formation

Under optical cooling of nuclei, a strongly correlated nuclear-spin polaron state can form in semiconductor nanostructures with localized charge carriers due to the strong hyperfine interaction of the localized electron spin with the surrounding nuclear spins. Here we develop a kinetic-equation formalism describing the nuclear-spin polaron formation. We present a derivation of the kinetic equations for an electron-nuclear spin system coupled to reservoirs of different electron and nuclear spin temperatures which generate the exact thermodynamic steady state for equal temperatures independent of the system size. We illustrate our approach using the analytical solution of the central spin model in the limit of an Ising form of the hyperfine coupling. For homogeneous hyperfine coupling constants, i.e., the box model, the model is reduced to an analytically solvable form. Based on the analysis of the nuclear-spin distribution function and the electron-nuclear spin correlators, we derive a relation between the electron and nuclear spin temperatures, where the correlated nuclear-spin polaron state is formed. In the limit of large nuclear baths, this temperature line coincides with the critical temperature of the mean-field theory for polaron formation. The criteria of the polaron formation in a finite-size system are discussed. We demonstrate that the system's behavior at the transition temperature does not depend on details of the hyperfine-coupling distribution function but only on the effective number of coupled bath spins. In addition, the kinetic equations enable the analysis of the temporal formation of the nuclear-polaron state, where we find the build-up process predominated by the nuclear spin-flip dynamics.

cond-mat.mes-hall↗

From image data towards microstructure information -- accuracy analysis at the digital core of materials

A cornerstone of computational solid mechanics in the context of digital transformation are databases for microstructures obtained from advanced tomography techniques. Uniform discretizations of pixelized images in 2D are the raw-data point of departure for simulation analyses. This paper proposes the concept of a unified error analysis for image-based microstructure representations in uniform resolution along with adaptively coarsened discretizations. The analysis distinguishes between a modeling error due to finite, possibly coarsened image resolution and a discretization error, investigates their quantitative relation, spatial distributions and their impacts on the simulation results both on the microscale and the macroscale in the context of computational homogenization. The assessment of accuracy and efficiency is carried out for an exemplary two-phase material. Beyond the example considered here the concept is a rational tool in the transformation of raw image data into microstructure information adapted to particular simulation needs and endows the digital twin of real microstructures with validated characteristics for reliable, predictive simulations.

math.NA↗

Learning Graph Edit Distance by Graph Neural Networks

The emergence of geometric deep learning as a novel framework to deal with graph-based representations has faded away traditional approaches in favor of completely new methodologies. In this paper, we propose a new framework able to combine the advances on deep metric learning with traditional approximations of the graph edit distance. Hence, we propose an efficient graph distance based on the novel field of geometric deep learning. Our method employs a message passing neural network to capture the graph structure, and thus, leveraging this information for its use on a distance computation. The performance of the proposed graph distance is validated on two different scenarios. On the one hand, in a graph retrieval of handwritten words~\ie~keyword spotting, showing its superior performance when compared with (approximate) graph edit distance benchmarks. On the other hand, demonstrating competitive results for graph similarity learning when compared with the current state-of-the-art on a recent benchmark dataset.

cs.CV↗

Automatic Creation of Text Corpora for Low-Resource Languages from the Internet: The Case of Swiss German

This paper presents SwissCrawl, the largest Swiss German text corpus to date. Composed of more than half a million sentences, it was generated using a customized web scraping tool that could be applied to other low-resource languages as well. The approach demonstrates how freely available web pages can be used to construct comprehensive text corpora, which are of fundamental importance for natural language processing. In an experimental evaluation, we show that using the new corpus leads to significant improvements for the task of language modeling. To capture new content, our approach will run continuously to keep increasing the corpus over time.

cs.CL↗

A Nonlinear Finite Element Heterogeneous Multiscale Method for the Homogenization of Hyperelastic Solids and a Novel Staggered Two-Scale Solution Algorithm

In this paper we address three aspects of nonlinear computational homogenization of elastic solids by two-scale finite element methods. First, we present a nonlinear formulation of the finite element heterogeneous multiscale method FE-HMM in a Lagrangean formulation that covers geometrical nonlinearity and, more general, hyperelasticity. Second, a-priori estimates of FE-HMM, which exist so far only for the fully linear elastic case in solid mechanics, are assessed in the regime of nonlinear elasticity. The measured convergence rates agree fairly well with those of the fully linear regime. Third, we revise the standard solution algorithm of FE$^2$ which is a staggered scheme in terms of a nested loop embedding the full solution of the micro problem into one macro solution iteration step. We demonstrate that suchlike staggered scheme, which is typically realized by a nested two-level Newton algorithm, can safely and efficiently be replaced by direct alternations between micro and macro iterations. The novel algorithmic structure is exemplarily detailed for the proposed nonlinear FE-HMM, its efficiency is substantiated by a considerable speedup in numerical tests.

math.NA↗

Semismooth Newton-type method for bilevel optimization: Global convergence and extensive numerical experiments

We consider the standard optimistic bilevel optimization problem, in particular upper- and lower-level constraints can be coupled. By means of the lower-level value function, the problem is transformed into a single-level optimization problem with a penalization of the value function constraint. For treating the latter problem, we develop a framework that does not rely on the direct computation of the lower-level value function or its derivatives. For each penalty parameter, the framework leads to a semismooth system of equations. This allows us to extend the semismooth Newton method to bilevel optimization. Besides global convergence properties of the method, we focus on achieving local superlinear convergence to a solution of the semismooth system. To this end, we formulate an appropriate CD-regularity assumption and derive suffcient conditions so that it is fulfilled. Moreover, we develop conditions to guarantee that a solution of the semismooth system is a local solution of the bilevel optimization problem. Extensive numerical experiments on $124$ examples of nonlinear bilevel optimization problems from the literature show that this approach exhibits a remarkable performance, where only a few penalty parameters need to be considered.

math.OC↗

From scalar to polar active matter: Connecting simulations with mean-field theory

We study numerically the phase behavior of self-propelled elliptical particles interacting through the "hard" repulsive Gay-Berne potential at infinite Péclet number. Changing a single parameter, the aspect ratio, allows to continuously go from discoid active Brownian particles to elongated polar rods. Discoids show phase separation, which changes to a cluster state of polar domains, which then form polar bands as the aspect ratio is increased. From the simulations, we identify and extract the two effective parameters entering the mean-field description: the force imbalance coefficient and the effective coupling to the local polarization. These two coefficients are sufficient to obtain a complete and consistent picture, unifying the paradigms of scalar and polar active matter.

cond-mat.stat-mech↗

Quorum-sensing active particles with discontinuous motility

We develop a dynamic mean-field theory for polar active particles that interact through a self-generated field, in particular one generated through emitting a chemical signal. While being a form of chemotactic response, it is different from conventional chemotaxis in that particles discontinuously change their motility when the local concentration surpasses a threshold. The resulting coupled equations for density and polarization are linear and can be solved analytically for simple geometries, yielding inhomogeneous density profiles. Specifically, here we consider a planar and circular interface. Our theory thus explains the observed coexistence of dense aggregates with an active gas. There are, however, differences to the more conventional picture of liquid-gas coexistence based on a free energy, most notably the absence of a critical point. We corroborate our analytical predictions by numerical simulations of active particles under confinement and interacting through volume exclusion. Excellent quantitative agreement is reached through an effective translational diffusion coefficient. We finally show that an additional response to the chemical gradient direction is sufficient to induce vortex clusters. Our results pave the way to engineer motility responses in order to achieve aggregation and collective behavior even at unfavorable conditions.

cond-mat.stat-mech↗

Alleviating Sequence Information Loss with Data Overlapping and Prime Batch Sizes

In sequence modeling tasks the token order matters, but this information can be partially lost due to the discretization of the sequence into data points. In this paper, we study the imbalance between the way certain token pairs are included in data points and others are not. We denote this a token order imbalance (TOI) and we link the partial sequence information loss to a diminished performance of the system as a whole, both in text and speech processing tasks. We then provide a mechanism to leverage the full token order information -Alleviated TOI- by iteratively overlapping the token composition of data points. For recurrent networks, we use prime numbers for the batch size to avoid redundancies when building batches from overlapped data points. The proposed method achieved state of the art performance in both text and speech related tasks.

cs.CL↗

Error Analysis for Quadtree-Type Mesh-Coarsening Algorithms Adapted to Pixelized Heterogeneous Microstructures

Pixel- and voxel-based representations of microstructures obtained from tomographic imaging methods is an established standard in computational materials science. The corresponding highly resolved, uniform discretitization in numerical analysis is adequate to accurately describe the geometry of interfaces and defects in microstructures and, therefore, to capture the physical processes in these regions of interest. For the defect-free interior of phases and grains however, the high resolution is in view of only weakly varying field properties not necessary such that mesh-coarsening in these regions can improve efficiency without severe losses of accuracy in simulations. The present work proposes two different variants of adaptive, quadtree-based mesh-coarsening algorithms applied to pixelized images that serves the purpose of a preprocessor for consecutive finite element analyses, here, in the context of numerical homogenization. Error analysis is carried out on the microscale by error estimation which itself is assessed by true error computation. A modified stress recovery scheme for a superconvergent error estimator is proposed which overcomes the deficits of the standard recovery scheme for nodal stress computation in cases of interfaces with stiffness jump. By virtue of error analysis the improved efficiency by the reduction of unknowns is put into relation to the increase of the discretization error. This quantitative analysis sets a rational basis for decisions on favorable meshes having the best trade-off between accuracy and efficiency as will be underpinned by various examples.

math.NA↗

Graph-Based Offline Signature Verification

Graphs provide a powerful representation formalism that offers great promise to benefit tasks like handwritten signature verification. While most state-of-the-art approaches to signature verification rely on fixed-size representations, graphs are flexible in size and allow modeling local features as well as the global structure of the handwriting. In this article, we present two recent graph-based approaches to offline signature verification: keypoint graphs with approximated graph edit distance and inkball models. We provide a comprehensive description of the methods, propose improvements both in terms of computational time and accuracy, and report experimental results for four benchmark datasets. The proposed methods achieve top results for several benchmarks, highlighting the potential of graph-based signature verification.

cs.CV↗

A Comprehensive Study of ImageNet Pre-Training for Historical Document Image Analysis

Automatic analysis of scanned historical documents comprises a wide range of image analysis tasks, which are often challenging for machine learning due to a lack of human-annotated learning samples. With the advent of deep neural networks, a promising way to cope with the lack of training data is to pre-train models on images from a different domain and then fine-tune them on historical documents. In the current research, a typical example of such cross-domain transfer learning is the use of neural networks that have been pre-trained on the ImageNet database for object recognition. It remains a mostly open question whether or not this pre-training helps to analyse historical documents, which have fundamentally different image properties when compared with ImageNet. In this paper, we present a comprehensive empirical survey on the effect of ImageNet pre-training for diverse historical document analysis tasks, including character recognition, style classification, manuscript dating, semantic segmentation, and content-based retrieval. While we obtain mixed results for semantic segmentation at pixel-level, we observe a clear trend across different network architectures that ImageNet pre-training has a positive effect on classification as well as content-based retrieval.

cs.CV↗

Convergence and Error Analysis of FE-HMM/FE$^2$ for Energetically Consistent Micro-Coupling Conditions in Linear Elastic Solids

A cornerstone of numerical homogenization is the equivalence of the microscopic and the macroscopic energy densities, which is referred to as Hill-Mandel condition. Among these coupling conditions, the cases of periodic, linear displacement and constant traction conditions are most prominent in engineering applications. While the stiffness hierarchy of these coupling conditions is a theoretically established and numerically verified result, very little is known about the numerical errors and convergence properties for each of them in various norms. The present work addresses these aspects both on the macroscale and the microscale for linear as well as quadratic finite element shape functions. The analysis addresses aspects of (i) regularity and how its loss affects the convergence behavior on both scales compared with the a priori estimates, of (ii) error propagation from micro to macro and of (iii) optimal micro-macro mesh refinement strategy. For constant traction conditions two different approaches are compared. The performance of a recovery-type error estimation based on superconvergence is assessed. All results of the present work are valid for both the Finite Element Heterogeneous Multiscale Method FE-HMM and for FE$^2$.

math.NA↗

Aggregation and sedimentation of active Brownian particles at constant affinity

We study the motility-induced phase separation of active particles driven through the interconversion of two chemical species controlled by ideal reservoirs (chemiostats). As a consequence, the propulsion speed is non-constant and depends on the actual inter-particle forces, enhancing the positive feedback between increased density and reduced motility that is responsible for the observed inhomogeneous density. For hard discs, we find that this effect is negligible and that the phase separation is controlled by the average propulsion speed. For soft particles and large propulsion speeds, however, we predict an observable impact on the collective behavior. We briefly comment on the reentrant behavior found for soft discs. Finally, we study the influence of non-constant propulsion on the sedimentation profile of non-interacting active particles.

cond-mat.stat-mech↗