text
stringlengths 137
2.43k
| field
stringclasses 2
values | label
int64 0
1
|
|---|---|---|
Title: Principled network extraction from images
Abstract: Images of natural systems may represent patterns of network-like structure, which could reveal important information about the topological properties of the underlying subject. However, the image itself does not automatically provide a formal definition of a network in terms of sets of nodes and edges. Instead, this information should be suitably extracted from the raw image data. Motivated by this, we present a principled model to extract network topologies from images that is scalable and efficient. We map this goal into solving a routing optimization problem where the solution is a network that minimizes an energy function which can be interpreted in terms of an operational and infrastructural cost. Our method relies on recent results from optimal transport theory and is a principled alternative to standard image-processing techniques that are based on heuristics. We test our model on real images of the retinal vascular system, slime mold and river networks and compare with routines combining image-processing techniques. Results are tested in terms of a similarity measure related to the amount of information preserved in the extraction. We find that our model finds networks from retina vascular network images that are more similar to hand-labeled ones, while also giving high performance in extracting networks from images of rivers and slime mold for which there is no ground truth available. While there is no unique method that fits all the images the best, our approach performs consistently across datasets, its algorithmic implementation is efficient and can be fully automatized to be run on several datasets with little supervision. | cs | 1 |
Title: Splitting Methods for differential equations
Abstract: This overview is devoted to splitting methods, a class of numerical integrators intended for differential equations that can be subdivided into different problems easier to solve than the original system. Closely connected with this class of integrators are composition methods, in which one or several low-order schemes are composed to construct higher-order numerical approximations to the exact solution. We analyze in detail the order conditions that have to be satisfied by these classes of methods to achieve a given order, and provide some insight about their qualitative properties in connection with geometric numerical integration and the treatment of highly oscillatory problems. Since splitting methods have received considerable attention in the realm of partial differential equations, we also cover this subject in the present survey, with special attention to parabolic equations and their problems. An exhaustive list of methods of different orders is collected and tested on simple examples. Finally, some applications of splitting methods in different areas, ranging from celestial mechanics to statistics, are also provided. | math | 0 |
Title: Toda brackets in n-angulated categories
Abstract: We introduce Toda brackets for n-angulated categories and show that the various definitions of Toda brackets coincide. We prove juggling formulas for these Toda brackets generalizing the triangulated case. Following that, we generalize a theorem due to Heller in the triangulated setting to the setting of n-angulated categories. We also provide several examples of computing Toda brackets for n-angulated categories. Finally, for an n-angulated category sitting in a triangulated category as in the setup of Geiss, Keller and Oppermann, we show that Toda brackets in the n-angulated sense coincide with n-fold Toda brackets in the triangulated sense up to an explicit sign. | math | 0 |
Title: Discover and Mitigate Unknown Biases with Debiasing Alternate Networks
Abstract: Deep image classifiers have been found to learn biases from datasets. To mitigate the biases, most previous methods require labels of protected attributes (e.g., age, skin tone) as full-supervision, which has two limitations: 1) it is infeasible when the labels are unavailable; 2) they are incapable of mitigating unknown biases -- biases that humans do not preconceive. To resolve those problems, we propose Debiasing Alternate Networks (DebiAN), which comprises two networks -- a Discoverer and a Classifier. By training in an alternate manner, the discoverer tries to find multiple unknown biases of the classifier without any annotations of biases, and the classifier aims at unlearning the biases identified by the discoverer. While previous works evaluate debiasing results in terms of a single bias, we create Multi-Color MNIST dataset to better benchmark mitigation of multiple biases in a multi-bias setting, which not only reveals the problems in previous methods but also demonstrates the advantage of DebiAN in identifying and mitigating multiple biases simultaneously. We further conduct extensive experiments on real-world datasets, showing that the discoverer in DebiAN can identify unknown biases that may be hard to be found by humans. Regarding debiasing, DebiAN achieves strong bias mitigation performance. | cs | 1 |
Title: Phase field modelling of fracture and fatigue in Shape Memory Alloys
Abstract: We present a new phase field framework for modelling fracture and fatigue in Shape Memory Alloys (SMAs). The constitutive model captures the superelastic behaviour of SMAs and damage is driven by the elastic and transformation strain energy densities. We consider both the assumption of a constant fracture energy and the case of a fracture energy dependent on the martensitic volume fraction. The framework is implemented in an implicit time integration scheme, with both monolithic and staggered solution strategies. The potential of this formulation is showcased by modelling a number of paradigmatic problems. First, a boundary layer model is used to examine crack tip fields and compute crack growth resistance curves (R-curves). We show that the model is able to capture the main fracture features associated with SMAs, including the toughening effect associated with stress-induced phase transformation. Insight is gained into the role of temperature, material strength, crack density function and fracture energy homogenisation. Secondly, several 2D and 3D boundary value problems are addressed, demonstrating the capabilities of the model in capturing complex cracking phenomena in SMAs, such as unstable crack growth, mixed-mode fracture or the interaction between several cracks. Finally, the model is extended to fatigue and used to capture crack nucleation and propagation in biomedical stents, a paradigmatic application of nitinol SMAs. | cs | 1 |
Title: Learning the 3D Fauna of the Web
Abstract: Learning 3D models of all animals on the Earth requires massively scaling up existing solutions. With this ultimate goal in mind, we develop 3D-Fauna, an approach that learns a pan-category deformable 3D animal model for more than 100 animal species jointly. One crucial bottleneck of modeling animals is the limited availability of training data, which we overcome by simply learning from 2D Internet images. We show that prior category-specific attempts fail to generalize to rare species with limited training images. We address this challenge by introducing the Semantic Bank of Skinned Models (SBSM), which automatically discovers a small set of base animal shapes by combining geometric inductive priors with semantic knowledge implicitly captured by an off-the-shelf self-supervised feature extractor. To train such a model, we also contribute a new large-scale dataset of diverse animal species. At inference time, given a single image of any quadruped animal, our model reconstructs an articulated 3D mesh in a feed-forward fashion within seconds. | cs | 0 |
Title: Unconditional stability of equilibria in thermally driven compressible fluids
Abstract: We show that small perturbations of the spatially homogeneous equilibrium of a thermally driven compressible viscous fluid are globally stable. Specifically, any weak solution of the evolutionary Navier--Stokes--Fourier system driven by thermal convection converges to an equilibrium as time goes to infinity. The main difficulty to overcome is the fact the problem does not admit any obvious Lyapunov function. The result applies, in particular, to the Rayleigh--B\' enard convection problem. | math | 0 |
Title: Discrete Time Markovian Agents Interacting Through a Potential
Abstract: A discrete time stochastic model for a multiagent system given in terms of a large collection of interacting Markov chains is studied. The evolution of the interacting particles is described through a time inhomogeneous transition probability kernel that depends on the 'gradient' of the potential field. The particles, in turn, dynamically modify the potential field through their cumulative input. Interacting Markov processes of the above form have been suggested as models for active biological transport in response to external stimulus such as a chemical gradient. One of the basic mathematical challenges is to develop a general theory of stability for such interacting Markovian systems and for the corresponding nonlinear Markov processes that arise in the large agent limit. Such a theory would be key to a mathematical understanding of the interactive structure formation that results from the complex feedback between the agents and the potential field. It will also be a crucial ingredient in developing simulation schemes that are faithful to the underlying model over long periods of time. The goal of this work is to study qualitative properties of the above stochastic system as the number of particles (N) and the time parameter (n) approach infinity. In this regard asymptotic properties of a deterministic nonlinear dynamical system, that arises in the propagation of chaos limit of the stochastic model, play a key role. We show that under suitable conditions this dynamical system has a unique fixed point. This result allows us to study stability properties of the underlying stochastic model. We show that as N \rightarrow \infty, the stochastic system is well approximated by the dynamical system, uniformly over time. As a consequence, for an arbitrarily initialized system, as N\rightarrow \infty and n \rightarrow \infty, the potential field and the empirical measure of the interacting particles are shown to converge to the unique fixed point of the dynamical system. In general, simulation of such interacting Markovian systems is a computationally daunting task. We propose a particle based approximation for the dynamic potential field which allows for a numerically tractable simulation scheme. It is shown that this simulation scheme well approximates the true physical system, uniformly over an infinite time horizon. | math | 1 |
Title: Moduli spaces of arrangements of 12 projective lines with a sextic point
Abstract: In this paper, we try to classify moduli spaces of arrangements of $12$ lines with sextic points. We show that moduli spaces of arrangements of $12$ lines with sextic points can consist of more than two connected components. We also present defining equations of the arrangements whose moduli spaces are not irreducible taking quotients by the complex conjugation by supply some potential Zariski pairs. Through complex conjugation we take quotients and supply some potential Zariski pairs. | math | 0 |
Title: The limit theorem for maximum of partial sums of exchangeable random variables
Abstract: We obtain the analogue of the classical result by Erd\"os and Kac on the limiting distribution of the maximum of partial sums for exchangeable random variables with zero mean and variance one. We show that, if the conditions of the central limit theorem of Blum et al. hold, the limit coincides with the classical one. Under more general assumptions, the probability of the random variables having conditional negative drift appears in the limiting distribution. | math | 1 |
Title: Periodic and quasi-motivic pencils of flat connections
Abstract: We introduce a new notion of a periodic pencil of flat connections on a smooth algebraic variety $X$. This is a family $\nabla(s_1,...,s_n)$ of flat connections on a trivial vector bundle on $X$ depending linearly on parameters $s_1,...,s_n$ and generically invariant, up to isomorphism, under the shifts $s_i\mapsto s_i+1$ for all $i$. If in addition $\nabla$ has regular singularities, we call it a quasi-motivic pencil. We use tools from complex analysis to establish various remarkable properties of such pencils over $\mathbb C$. For example, we show that the monodromy of a quasi-motivic pencil is defined over the field of algebraic functions in $e^{2\pi is_j}$, and that its singularities are constrained to an arrangement of hyperplanes with integer normal vectors. Then we show that many important examples of families of flat connections, such as Knizhnik-Zamolodchikov, Dunkl, and Casimir connections, are quasi-motivic and thus periodic pencils. Besides being interesting in its own right, the periodic property of a pencil of flat connections turns out to be very useful in computing the eigenvalues of the $p$-curvature of its reduction to positive characteristic. This will be done in our forthcoming paper. | math | 0 |
Title: Local behavior for solutions to anisotropic weighted quasilinear degenerate parabolic equations
Abstract: This paper aims to study the local behavior of solutions to a class of anisotropic weighted quasilinear degenerate parabolic equations with the weights comprising two power-type weights of different dimensions. We first capture the asymptotic behavior of the solution near the singular or degenerate point of the weights. In particular, we find an explicit upper bound on the decay rate exponent determined by the structures of the equations and weights, which can be achieved under certain condition and meanwhile reflects the damage effect of the weights on the regularity of the solution. Furthermore, we prove the local H\"{o}lder regularity of solutions to non-homogeneous parabolic $p$-Laplace equations with single power-type weights. | math | 0 |
Title: Some Grönwall inequalities for a class of discretizations of time fractional equations on nonuniform meshes
Abstract: We consider the completely positive discretizations of fractional ordinary differential equations (FODEs) on nonuniform meshes. Making use of the resolvents for nonuniform meshes, we first establish comparison principles for the discretizations. Then we prove some discrete Gr\"onwall inequalities using the comparison principles and careful analysis of the solutions to the time continuous FODEs. Our results do not have any restrictions on the step size ratio. The Gr\"onwall inequalities for dissipative equations can be used to obtain the uniform-in-time error control and decay estimates of the numerical solutions. The Gr\"onwall inequalities are then applied to subdiffusion problems and the time fractional Allen-Cahn equations for illustration. | math | 0 |
Title: A novel iterative time integration scheme for linear poroelasticity
Abstract: Within this paper, we introduce and analyze a novel time stepping scheme for linear poroelasticity. In each time frame, we iteratively solve the flow and mechanics equations with an additional damping step for the pressure variable. Depending on the coupling strength of the two equations, we explicitly quantify the needed number of inner iteration steps to guarantee first-order convergence. Within a number of numerical experiments, we confirm the theoretical results and study the dependence of inner iteration steps in terms of the coupling strength. Moreover, we compare our method to the well-known fixed-stress scheme. | math | 0 |
Title: Vanishing theorems on covering manifolds
Abstract: Let $M$ be an oriented even-dimensional Riemannian manifold on which a discrete group $\Gamma$ of orientation-preserving isometries acts freely, so that the quotient $X=M/\Gamma$ is compact. We prove a vanishing theorem for a half-kernel of a $\Gamma$-invariant Dirac operator on a $\Gamma$-equivariant Clifford module over $M$, twisted by a sufficiently large power of a $\Gamma$-equivariant line bundle, whose curvature is non-degenerate at any point of $M$. This generalizes our previous vanishing theorems for Dirac operators on a compact manifold. In particular, if $M$ is an almost complex manifold we prove a vanishing theorem for the half-kernel of a $\spin^c$ Dirac operator, twisted by a line bundle with curvature of a mixed sign. In this case we also relax the assumption of non-degeneracy of the curvature. When $M$ is a complex manifold our results imply analogues of Kodaira and Andreotti-Grauert vanishing theorems for covering manifolds. As another application, we show that semiclassically the $\spin^c$ quantization of an almost complex covering manifold gives an "honest" Hilbert space. This generalizes a result of Borthwick and Uribe, who considered quantization of compact manifolds. Application of our results to homogeneous manifolds of a real semisimple Lie group leads to new proofs of Griffiths-Schmidt and Atiyah-Schmidt vanishing theorems. | math | 1 |
Title: Further results on orbits and incidence matrices for the class $\mathcal{O}_6$ of lines external to the twisted cubic in $\mathrm{PG}(3,q)$
Abstract: In the literature, lines of the projective space $\mathrm{PG}(3,q)$ are partitioned into classes, each of which is a union of line orbits under the stabilizer group of the twisted cubic. The least studied class is named $\mathcal{O}_6$. This class contains lines external to the twisted cubic which are not its chords or axes and do not lie in any of its osculating planes. For even and odd $q$, we propose a new family of orbits of $\mathcal{O}_6$ and investigate in detail their stabilizer groups and the corresponding submatrices of the point-line and plane-line incidence matrices. To obtain these submatrices, we explored the number of solutions of cubic and quartic equations connected with intersections of lines (including the tangents to the twisted cubic), points, and planes in $\mathrm{PG}(3,q)$. | math | 0 |
Title: Leveraging ParsBERT and Pretrained mT5 for Persian Abstractive Text Summarization
Abstract: Text summarization is one of the most critical Natural Language Processing (NLP) tasks. More and more researches are conducted in this field every day. Pre-trained transformer-based encoder-decoder models have begun to gain popularity for these tasks. This paper proposes two methods to address this task and introduces a novel dataset named pn-summary for Persian abstractive text summarization. The models employed in this paper are mT5 and an encoder-decoder version of the ParsBERT model (i.e., a monolingual BERT model for Persian). These models are fine-tuned on the pn-summary dataset. The current work is the first of its kind and, by achieving promising results, can serve as a baseline for any future work. | cs | 1 |
Title: Historical Review of Fluid Antenna and Movable Antenna
Abstract: Recently, significant attention has been drawn to the development of two antenna technologies known as "Fluid Antenna" and "Movable Antenna" in wireless communication research community, owing to their flexibility and reconfigurability for improving the wireless system performance in various applications. However, some confusions/concerns have also ensued on their nomenclature. In fact, both "Fluid Antenna" and "Movable Antenna" are not newly-made terms, while they have a longstanding presence in the field of antenna technology. This article thus aims to review the historical evolution of these technologies for fostering a clear understanding of their origins and recent development in the realm of wireless communication. It is hoped that this article will help dispel any confusion, concern or even dispute on the appropriate use of their names in the literature and motivate more research endeavors to focus on resolving their technical issues in the future. | cs | 0 |
Title: CLAPP: Contrastive Language-Audio Pre-training in Passive Underwater Vessel Classification
Abstract: Existing research on audio classification faces challenges in recognizing attributes of passive underwater vessel scenarios and lacks well-annotated datasets due to data privacy concerns. In this study, we introduce CLAPP (Contrastive Language-Audio Pre-training in Passive Underwater Vessel Classification), a novel model. Our aim is to train a neural network using a wide range of vessel audio and vessel state text pairs obtained from an oceanship dataset. CLAPP is capable of directly learning from raw vessel audio data and, when available, from carefully curated labels, enabling improved recognition of vessel attributes in passive underwater vessel scenarios. Model's zero-shot capability allows predicting the most relevant vessel state description for a given vessel audio, without directly optimizing for the task. Our approach aims to solve 2 challenges: vessel audio-text classification and passive underwater vessel audio attribute recognition. The proposed method achieves new state-of-the-art results on both Deepship and Shipsear public datasets, with a notable margin of about 7%-13% for accuracy compared to prior methods on zero-shot task. | cs | 0 |
Title: Markov modulated fluid network process: Tail asymptotics of the stationary distribution
Abstract: We consider a Markov modulated fluid network with a finite number of stations. We are interested in the tail asymptotics behavior of the stationary distribution of its buffer content process. Using two different approaches, we derive upper and lower bounds for the stationary tail decay rate in various directions. Both approaches are based on a well-known time-evolution formula of a Markov process, so-called Dynkin's formula, where a key ingredient is a suitable choice of test functions. Those results show how multidimensional tail asymptotics can be studied for the more than two-dimensional case, which is known as a hard problem. | math | 1 |
Title: Smoothness Estimation for Whittle-Matérn Processes on Closed Riemannian Manifolds
Abstract: The family of Mat\'ern kernels are often used in spatial statistics, function approximation and Gaussian process methods in machine learning. One reason for their popularity is the presence of a smoothness parameter that controls, for example, optimal error bounds for kriging and posterior contraction rates in Gaussian process regression. On closed Riemannian manifolds, we show that the smoothness parameter can be consistently estimated from the maximizer(s) of the Gaussian likelihood when the underlying data are from point evaluations of a Gaussian process and, perhaps surprisingly, even when the data comprise evaluations of a non-Gaussian process. The points at which the process is observed need not have any particular spatial structure beyond quasi-uniformity. Our methods are based on results from approximation theory for the Sobolev scale of Hilbert spaces. Moreover, we generalize a well-known equivalence of measures phenomenon related to Mat\'ern kernels to the non-Gaussian case by using Kakutani's theorem. | math | 0 |
Title: DiffAttack: Evasion Attacks Against Diffusion-Based Adversarial Purification
Abstract: Diffusion-based purification defenses leverage diffusion models to remove crafted perturbations of adversarial examples and achieve state-of-the-art robustness. Recent studies show that even advanced attacks cannot break such defenses effectively, since the purification process induces an extremely deep computational graph which poses the potential problem of gradient obfuscation, high memory cost, and unbounded randomness. In this paper, we propose a unified framework DiffAttack to perform effective and efficient attacks against diffusion-based purification defenses, including both DDPM and score-based approaches. In particular, we propose a deviated-reconstruction loss at intermediate diffusion steps to induce inaccurate density gradient estimation to tackle the problem of vanishing/exploding gradients. We also provide a segment-wise forwarding-backwarding algorithm, which leads to memory-efficient gradient backpropagation. We validate the attack effectiveness of DiffAttack compared with existing adaptive attacks on CIFAR-10 and ImageNet. We show that DiffAttack decreases the robust accuracy of models compared with SOTA attacks by over 20% on CIFAR-10 under $\ell_\infty$ attack $(\epsilon=8/255)$, and over 10% on ImageNet under $\ell_\infty$ attack $(\epsilon=4/255)$. We conduct a series of ablations studies, and we find 1) DiffAttack with the deviated-reconstruction loss added over uniformly sampled time steps is more effective than that added over only initial/final steps, and 2) diffusion-based purification with a moderate diffusion length is more robust under DiffAttack. | cs | 0 |
Title: Learning Concept Embeddings with Combined Human-Machine Expertise
Abstract: This paper presents our work on "SNaCK," a low-dimensional concept embedding algorithm that combines human expertise with automatic machine similarity kernels. Both parts are complimentary: human insight can capture relationships that are not apparent from the object's visual similarity and the machine can help relieve the human from having to exhaustively specify many constraints. We show that our SNaCK embeddings are useful in several tasks: distinguishing prime and nonprime numbers on MNIST, discovering labeling mistakes in the Caltech UCSD Birds (CUB) dataset with the help of deep-learned features, creating training datasets for bird classifiers, capturing subjective human taste on a new dataset of 10,000 foods, and qualitatively exploring an unstructured set of pictographic characters. Comparisons with the state-of-the-art in these tasks show that SNaCK produces better concept embeddings that require less human supervision than the leading methods. | cs | 1 |
Title: Natural Language Adversarial Defense through Synonym Encoding
Abstract: In the area of natural language processing, deep learning models are recently known to be vulnerable to various types of adversarial perturbations, but relatively few works are done on the defense side. Especially, there exists few effective defense method against the successful synonym substitution based attacks that preserve the syntactic structure and semantic information of the original text while fooling the deep learning models. We contribute in this direction and propose a novel adversarial defense method called Synonym Encoding Method (SEM). Specifically, SEM inserts an encoder before the input layer of the target model to map each cluster of synonyms to a unique encoding and trains the model to eliminate possible adversarial perturbations without modifying the network architecture or adding extra data. Extensive experiments demonstrate that SEM can effectively defend the current synonym substitution based attacks and block the transferability of adversarial examples. SEM is also easy and efficient to scale to large models and big datasets. | cs | 1 |
Title: Sub-Riemannian curvature of Carnot groups with rank-two distributions
Abstract: The notion of curvature discussed in this paper is a far going generalization of the Riemannian sectional curvature. It was first introduced by Agrachev, Barilari and Rizzi in arXiv:1306.5318, and it is defined for a wide class of optimal control problems: a unified framework including geometric structures such as Riemannian, sub-Riemannian, Finsler, and sub-Finsler structures. In this work we study the generalized sectional curvature of Carnot groups with rank-two distributions. In particular, we consider the Cartan group and Carnot groups with horizontal distribution of Goursat-type. In these Carnot groups we characterize ample and equiregular geodesics. For Carnot groups with horizontal Goursat distribution we show that their generalized sectional curvatures depend only on the Engel part of the distribution. This family of Carnot groups contains naturally the three-dimensional Heisenberg group, as well as the Engel group. Moreover, we also show that in the Engel and Cartan groups there exist initial covectors for which there is an infinite discrete set of times at which the corresponding ample geodesics are not equiregular. | math | 1 |
Title: Simplification of inclusion-exclusion on intersections of unions with application to network systems reliability
Abstract: Reliability of safety-critical systems is an important issue in system engineering and in most practical situations the reliability of a non series-parallel network system has to be calculated. Some methods for calculating reliability use the probability principle of inclusion-exclusion. When dealing with complex networks, this leads to very long mathematical expressions which are usually computationally very expensive to calculate. In this paper, we provide a new expression to simplify the probability principle of inclusion-exclusion's formula for intersections of unions, which appear when calculating reliability on non series parallel network systems. This new expression has much less terms, which reduces enormously the computational cost. We also show that the general form of the probability principle of inclusion-exclusion's formula has double exponential complexity whereas the simplified form has only exponential complexity with a linear exponent. Finally, we illustrate how to use this result when calculating the reliability of a door management system in aircraft engineering. | math | 1 |
Title: On the measurability of a numerical function with respect to a family of sets
Abstract: The following document is a translation (from French to English) of: Gabriele H. Greco, Sur la mesurabilit\'e d'une fonction num\'erique par rapport \`a une famille d'ensembles, Rendiconti del Seminario Matematico della Universit\`a di Padova}, tome 65 (1981), pp. 163--176. Translated by: Jonathan M. Keith, School of Mathematics, Monash University, jonathan.keith@monash.edu. With thanks to: Prof. Andrea D'Agnolo, Editor-in-Chief of the above journal, for permission to publish this translation. | math | 0 |
Title: Learning with Noisy Labels by Adaptive Gradient-Based Outlier Removal
Abstract: An accurate and substantial dataset is essential for training a reliable and well-performing model. However, even manually annotated datasets contain label errors, not to mention automatically labeled ones. Previous methods for label denoising have primarily focused on detecting outliers and their permanent removal - a process that is likely to over- or underfilter the dataset. In this work, we propose AGRA: a new method for learning with noisy labels by using Adaptive GRAdient-based outlier removal. Instead of cleaning the dataset prior to model training, the dataset is dynamically adjusted during the training process. By comparing the aggregated gradient of a batch of samples and an individual example gradient, our method dynamically decides whether a corresponding example is helpful for the model at this point or is counter-productive and should be left out for the current update. Extensive evaluation on several datasets demonstrates AGRA's effectiveness, while a comprehensive results analysis supports our initial hypothesis: permanent hard outlier removal is not always what model benefits the most from. | cs | 0 |
Title: An improved spectral inequality for sums of eigenfunctions
Abstract: We establish a new spectral inequality for the quantified estimation of the $H^s$-norm, $s\ge 0$ of a finite linear combination of eigenfunctions in a domain in terms of its $H^s$-norm in a strictly open subset of the whole domain. The corresponding upper bound depends exponentially on the square root of the frequency number associated to the linear combination. | math | 0 |
Title: Testing popularity in linear time via maximum matching
Abstract: Popularity is an approach in mechanism design to find fair structures in a graph, based on the votes of the nodes. Popular matchings are the relaxation of stable matchings: given a graph G=(V,E) with strict preferences on the neighbors of the nodes, a matching M is popular if there is no other matching M' such that the number of nodes preferring M' is more than those preferring M. This paper considers the popularity testing problem, when the task is to decide whether a given matching is popular or not. Previous algorithms applied reductions to maximum weight matchings. We give a new algorithm for testing popularity by reducing the problem to maximum matching testing, thus attaining a linear running time O(|E|). Linear programming-based characterization of popularity is often applied for proving the popularity of a certain matching. As a consequence of our algorithm we derive a more structured dual witness than previous ones. Based on this result we give a combinatorial characterization of fractional popular matchings, which are a special class of popular matchings. | cs | 0 |
Title: A Note on the Two Approaches to Stringy Functors for Orbifolds
Abstract: In this note, we reconcile two approaches that have been used to construct stringy multiplications. The pushing forward after pulling back that has been used to give a global stringy extension of the functors K_0,K^{top},A^*,H^* [CR, FG, AGV, JKK2], and the pulling back after having pushed forward, which we have previously used in our (re)-construction program for G-Frobenius algebras, notably in considerations of singularities with symmetries and for symmetric products. A similar approach was also used by [CH] in their considerations of the Chen-Ruan product in a deRham setting for Abelian orbifolds. We show that the pull-push formalism has a solution by the push-pull equations in two situations. The first is a deRham formalism with Thom push-forward maps and the second is the setting of cyclic twisted sectors, which was at the heart of the (re)-construction program. We go on to do formal calculations using fractional Euler classes which allows us to formally treat all the stringy multiplications mentioned above in the general setting. The upshot is the formal trivialization of the co-cycles of the reconstruction program using the presentation of the obstruction bundle of [JKK2]. | math | 1 |
Title: Asymptotically Optimal Proper Conflict-Free Colouring
Abstract: A proper conflict-free colouring of a graph is a colouring of the vertices such that any two adjacent vertices receive different colours, and for every non-isolated vertex $v$, some colour appears exactly once on the neighbourhood of $v$. Caro, Petru\v{s}evski and \v{S}krekovski conjectured that every connected graph with maximum degree $\Delta \geq 3$ has a proper conflict-free colouring with at most $\Delta+1$ colours. This conjecture holds for $\Delta=3$ and remains open for $\Delta \geq 4$. In this paper we prove that this conjecture holds asymptotically; namely, every graph with maximum degree $\Delta$ has a proper conflict-free colouring with $(1+o(1))\Delta$ colours. | math | 0 |
Title: Additive Correlation and the Inverse Problem for the Large Sieve
Abstract: Let $A\subset [1,N]$ be a set of positive integers with $|A|\gg \sqrt N$. We show that if avoids about $p/2$ residue classes modulo $p$ for each prime $p$, the $A$ must correlate additively with the squares $S=\{n^2:1\leq n\leq \sqrt N\}$, in the sense that we have the additive energy estimate $E(A,S)\gg N\log N$. This is, in a sense, optimal. | math | 1 |
Title: Existence of weak solutions to borderline double-phase problems with logarithmic convection term
Abstract: In this study, we devote our attention to the question of clarifying the existence of a weak solution to a class of quasilinear double-phase elliptic equations with logarithmic convection terms under some appropriate assumptions on data. The proof is based on the surjectivity theorem for the pseudo-monotone operators and modular function spaces and embedding theorems in generalized Orlicz spaces. Our approach in this paper can be extended naturally to a larger class of unbalanced double-phase problems with logarithmic perturbation and gradient dependence on the right-hand sides. | math | 0 |
Title: Some remarks on combinatorial wall-crossing
Abstract: We establish a new simple explicit description of combinatorial wall-crossing for the rational Cherednik algebra applied to the trivial representation. In this way we recover a theorem of P. Dimakis and G. Yue. We also present two conjectures on combinatorial wall-crossing which were found using computer experiments. | math | 1 |
Title: ALOHA Receivers: a Network Calculus Approach for Analyzing Coded Multiple Access with SIC
Abstract: Motivated by the need to hide the complexity of the physical layer from performance analysis in a layer 2 protocol, a class of abstract receivers, called Poisson receivers, was recently proposed in [1] as a probabilistic framework for providing differentiated services in uplink transmissions in 5G networks. In this paper, we further propose a deterministic framework of ALOHA receivers that can be incorporated into the probabilistic framework of Poisson receivers for analyzing coded multiple access with successive interference cancellation. An ALOHA receiver is characterized by a success function of the number of packets that can be successfully received. Inspired by the theory of network calculus, we derive various algebraic properties for several operations on success functions and use them to prove various closure properties of ALOHA receivers, including (i) ALOHA receivers in tandem, (ii) cooperative ALOHA receivers, (iii) ALOHA receivers with traffic multiplexing, and (iv) ALOHA receivers with packet coding. By conducting extensive simulations, we show that our theoretical results match extremely well with the simulation results. | cs | 1 |
Title: Towards High Fidelity Face Relighting with Realistic Shadows
Abstract: Existing face relighting methods often struggle with two problems: maintaining the local facial details of the subject and accurately removing and synthesizing shadows in the relit image, especially hard shadows. We propose a novel deep face relighting method that addresses both problems. Our method learns to predict the ratio (quotient) image between a source image and the target image with the desired lighting, allowing us to relight the image while maintaining the local facial details. During training, our model also learns to accurately modify shadows by using estimated shadow masks to emphasize on the high-contrast shadow borders. Furthermore, we introduce a method to use the shadow mask to estimate the ambient light intensity in an image, and are thus able to leverage multiple datasets during training with different global lighting intensities. With quantitative and qualitative evaluations on the Multi-PIE and FFHQ datasets, we demonstrate that our proposed method faithfully maintains the local facial details of the subject and can accurately handle hard shadows while achieving state-of-the-art face relighting performance. | cs | 1 |
Title: Fast and Smooth Interpolation on Wasserstein Space
Abstract: We propose a new method for smoothly interpolating probability measures using the geometry of optimal transport. To that end, we reduce this problem to the classical Euclidean setting, allowing us to directly leverage the extensive toolbox of spline interpolation. Unlike previous approaches to measure-valued splines, our interpolated curves (i) have a clear interpretation as governing particle flows, which is natural for applications, and (ii) come with the first approximation guarantees on Wasserstein space. Finally, we demonstrate the broad applicability of our interpolation methodology by fitting surfaces of measures using thin-plate splines. | math | 1 |
Title: Schur Multipliers of Nilpotent Lie Algebras
Abstract: We consider the Schur multipliers of finite dimensional nilpotent Lie algebras. If the algebra has dimension greater than one, then the Schur multiplier is non-zero. We give a direct proof of an upper bound for the dimension of the Schur multiplier as a function of class and the minimum number of generators of the algebra. We then compare this bound with another known bound. | math | 1 |
Title: Towards Palmprint Verification On Smartphones
Abstract: With the rapid development of mobile devices, smartphones have gradually become an indispensable part of people's lives. Meanwhile, biometric authentication has been corroborated to be an effective method for establishing a person's identity with high confidence. Hence, recently, biometric technologies for smartphones have also become increasingly sophisticated and popular. But it is noteworthy that the application potential of palmprints for smartphones is seriously underestimated. Studies in the past two decades have shown that palmprints have outstanding merits in uniqueness and permanence, and have high user acceptance. However, currently, studies specializing in palmprint verification for smartphones are still quite sporadic, especially when compared to face- or fingerprint-oriented ones. In this paper, aiming to fill the aforementioned research gap, we conducted a thorough study of palmprint verification on smartphones and our contributions are twofold. First, to facilitate the study of palmprint verification on smartphones, we established an annotated palmprint dataset named MPD, which was collected by multi-brand smartphones in two separate sessions with various backgrounds and illumination conditions. As the largest dataset in this field, MPD contains 16,000 palm images collected from 200 subjects. Second, we built a DCNN-based palmprint verification system named DeepMPV+ for smartphones. In DeepMPV+, two key steps, ROI extraction and ROI matching, are both formulated as learning problems and then solved naturally by modern DCNN models. The efficiency and efficacy of DeepMPV+ have been corroborated by extensive experiments. To make our results fully reproducible, the labeled dataset and the relevant source codes have been made publicly available at https://cslinzhang.github.io/MobilePalmPrint/. | cs | 1 |
Title: Quasi-streamwise vortices and enhanced dissipation for the incompressible 3D Navier-Stokes equations
Abstract: We consider the 3D incompressible Navier-Stokes equations under the following $2+\frac{1}{2}$-dimensional situation: vertical vortex blob (quasi-streamwise vortices) being stretched by two-dimensional shear flow. We prove enhanced dissipation induced by such quasi-streamwise vortices. | math | 1 |
Title: Uniform mixing and completely positive sofic entropy
Abstract: Let $G$ be a countable discrete sofic group. We define a concept of uniform mixing for measure-preserving $G$-actions and show that it implies completely positive sofic entropy. When $G$ contains an element of infinite order, we use this to produce an uncountable family of pairwise nonisomorphic $G$-actions with completely positive sofic entropy. None of our examples is a factor of a Bernoulli shift. | math | 1 |
Title: A Decentralized Multiagent-Based Task Scheduling Framework for Handling Uncertain Events in Fog Computing
Abstract: Fog computing has become an attractive research topic in recent years. As an extension of the cloud, fog computing provides computing resources for Internet of Things (IoT) applications through communicative fog nodes located at the network edge. Fog nodes assist cloud services in handling real-time and mobile applications by bringing the processing capability to where the data is generated. However, the introduction of fog nodes can increase scheduling openness and uncertainty. The scheduling issues in fog computing need to consider the geography, load balancing, and network latency between IoT devices, fog nodes, as well as the parent cloud. Besides, the scheduling methods also need to deal with the occurrence of uncertain events in real-time so as to ensure service reliability. This paper proposes an agent-based framework with a decentralized structure to construct the architecture of fog computing, while three agent-based algorithms are proposed to implement the scheduling, load balance, and rescheduling processes. The proposed framework is implemented by JADE and evaluated on the iFogSim toolkit. Experimental results show that the proposed scheduling framework can adaptively schedule tasks and resources for different service requests in fog computing and can also improve the task success rate when uncertain events occur. | cs | 0 |
Title: Centers of categorified endomorphism rings
Abstract: We prove that for a large class of well-behaved cocomplete categories $\mathcal C$ the weak and strong Drinfeld centers of the monoidal category $\mathcal{E}$ of cocontinuous endofunctors of $\mathcal{C}$ coincide. This generalizes similar results in the literature, where $\mathcal{C}$ is the category of modules over a ring $A$ and hence $\mathcal{E}$ is the category of $A$-bimodules. | math | 1 |
Title: Search Games with Predictions
Abstract: We study search games between a mobile Searcher and an immobile Hider in which the Searcher aims to minimize some payoff, which is either the time to find the Hider (the search time), or a normalized search time. We consider a new setting in which the Searcher has some potentially erroneous information, or prediction on the Hider's position. Specifically, we study tradeoffs between the consistency of a search strategy (i.e., its worst case expected payoff assuming the prediction is correct) and the robustness (i.e., the worst case expected payoff assuming that the prediction is adversarially generated). We show how to apply this framework in search games over both discrete and continuous, as well as bounded and unbounded spaces. Specifically, we prove optimal consistency/robustness tradeoffs for three fundamental search games, namely searching in a number of discrete locations, expanding search in a tree network, and searching in the infinite line. Our study is the first to address the full power of mixed (randomized) strategies; previous work focused only on deterministic strategies, or relied on stochastic assumptions that do not guarantee worst-case robustness in adversarial situations. | cs | 0 |
Title: Improved uncertainty quantification for neural networks with Bayesian last layer
Abstract: Uncertainty quantification is an important task in machine learning - a task in which standardneural networks (NNs) have traditionally not excelled. This can be a limitation for safety-critical applications, where uncertainty-aware methods like Gaussian processes or Bayesian linear regression are often preferred. Bayesian neural networks are an approach to address this limitation. They assume probability distributions for all parameters and yield distributed predictions. However, training and inference are typically intractable and approximations must be employed. A promising approximation is NNs with Bayesian last layer (BLL). They assume distributed weights only in the linear output layer and yield a normally distributed prediction. To approximate the intractable Bayesian neural network, point estimates of the distributed weights in all but the last layer should be obtained by maximizing the marginal likelihood. This has previously been challenging, as the marginal likelihood is expensive to evaluate in this setting. We present a reformulation of the log-marginal likelihood of a NN with BLL which allows for efficient training using backpropagation. Furthermore, we address the challenge of uncertainty quantification for extrapolation points. We provide a metric to quantify the degree of extrapolation and derive a method to improve the uncertainty quantification for these points. Our methods are derived for the multivariate case and demonstrated in a simulation study. In comparison to Bayesian linear regression with fixed features, and a Bayesian neural network trained with variational inference, our proposed method achieves the highest log-predictive density on test data. | cs | 0 |
Title: Non-singular actions of infinite-dimensional groups and polymorphisms
Abstract: Let $Z$ be a probabilistic measure space with a measure $\zeta$, $\mathbb{R}^\times$ be the multiplicative group of positive reals, let $t$ be the coordinate on $\mathbb{R}^\times$. A polymorphism of $Z$ is a measure $\pi$ on $Z\times Z\times \mathbb{R}^\times$ such that for any measurable $A$, $B\subset Z$ we have $\pi(A\times Z\times \mathbb{R}^\times)=\zeta(A)$ and the integral $\int t\,d\pi(z,u,t)$ over $Z\times B\times \mathbb{R}^\times$ is $\zeta(B)$. The set of all polymorphisms has a natural semigroup structure, the group of all nonsingular transformations is dense in this semigroup. We discuss a problem of closure in polymorphisms for certain types of infinite dimensional ('large') groups and show that a non-singular action of an infinite-dimensional group generates a representation of its train (category of double cosets) by polymorphisms. | math | 0 |
Title: Face Relighting with Geometrically Consistent Shadows
Abstract: Most face relighting methods are able to handle diffuse shadows, but struggle to handle hard shadows, such as those cast by the nose. Methods that propose techniques for handling hard shadows often do not produce geometrically consistent shadows since they do not directly leverage the estimated face geometry while synthesizing them. We propose a novel differentiable algorithm for synthesizing hard shadows based on ray tracing, which we incorporate into training our face relighting model. Our proposed algorithm directly utilizes the estimated face geometry to synthesize geometrically consistent hard shadows. We demonstrate through quantitative and qualitative experiments on Multi-PIE and FFHQ that our method produces more geometrically consistent shadows than previous face relighting methods while also achieving state-of-the-art face relighting performance under directional lighting. In addition, we demonstrate that our differentiable hard shadow modeling improves the quality of the estimated face geometry over diffuse shading models. | cs | 1 |
Title: Algorithmically Effective Differentially Private Synthetic Data
Abstract: We present a highly effective algorithmic approach for generating $\varepsilon$-differentially private synthetic data in a bounded metric space with near-optimal utility guarantees under the 1-Wasserstein distance. In particular, for a dataset $X$ in the hypercube $[0,1]^d$, our algorithm generates synthetic dataset $Y$ such that the expected 1-Wasserstein distance between the empirical measure of $X$ and $Y$ is $O((\varepsilon n)^{-1/d})$ for $d\geq 2$, and is $O(\log^2(\varepsilon n)(\varepsilon n)^{-1})$ for $d=1$. The accuracy guarantee is optimal up to a constant factor for $d\geq 2$, and up to a logarithmic factor for $d=1$. Our algorithm has a fast running time of $O(\varepsilon dn)$ for all $d\geq 1$ and demonstrates improved accuracy compared to the method in (Boedihardjo et al., 2022) for $d\geq 2$. | cs | 1 |
Title: A Novel Paradigm for Neural Computation: X-Net with Learnable Neurons and Adaptable Structure
Abstract: Artificial neural networks (ANNs) have permeated various disciplinary domains, ranging from bioinformatics to financial analytics, where their application has become an indispensable facet of contemporary scientific research endeavors. However, the inherent limitations of traditional neural networks arise due to their relatively fixed network structures and activation functions. 1, The type of activation function is single and relatively fixed, which leads to poor "unit representation ability" of the network, and it is often used to solve simple problems with very complex networks; 2, the network structure is not adaptive, it is easy to cause network structure redundant or insufficient. To address the aforementioned issues, this study proposes a novel neural network called X-Net. By utilizing our designed Alternating Backpropagation mechanism, X-Net dynamically selects appropriate activation functions based on derivative information during training to enhance the network's representation capability for specific tasks. Simultaneously, it accurately adjusts the network structure at the neuron level to accommodate tasks of varying complexities and reduce computational costs. Through a series of experiments, we demonstrate the dual advantages of X-Net in terms of reducing model size and improving representation power. Specifically, in terms of the number of parameters, X-Net is only 3$\%$ of baselines on average, and only 1.4$\%$ under some tasks. In terms of representation ability, X-Net can achieve an average $R^2$=0.985 on the fitting task by only optimizing the activation function without introducing any parameters. Finally, we also tested the ability of X-Net to help scientific discovery on data from multiple disciplines such as society, energy, environment, and aerospace, and achieved concise and good results. | cs | 0 |
Title: A Kernel Framework to Quantify a Model's Local Predictive Uncertainty under Data Distributional Shifts
Abstract: Traditional Bayesian approaches for model uncertainty quantification rely on notoriously difficult processes of marginalization over each network parameter to estimate its probability density function (PDF). Our hypothesis is that internal layer outputs of a trained neural network contain all of the information related to both its mapping function (quantified by its weights) as well as the input data distribution. We therefore propose a framework for predictive uncertainty quantification of a trained neural network that explicitly estimates the PDF of its raw prediction space (before activation), p(y'|x,w), which we refer to as the model PDF, in a Gaussian reproducing kernel Hilbert space (RKHS). The Gaussian RKHS provides a localized density estimate of p(y'|x,w), which further enables us to utilize gradient based formulations of quantum physics to decompose the model PDF in terms of multiple local uncertainty moments that provide much greater resolution of the PDF than the central moments characterized by Bayesian methods. This provides the framework with a better ability to detect distributional shifts in test data away from the training data PDF learned by the model. We evaluate the framework against existing uncertainty quantification methods on benchmark datasets that have been corrupted using common perturbation techniques. The kernel framework is observed to provide model uncertainty estimates with much greater precision based on the ability to detect model prediction errors. | cs | 1 |
Title: All terms in a complete exceptional sequence are relatively projective or relatively injective
Abstract: We prove the statement in the title, define the terms and give one application. | math | 0 |
Title: Contractibility of the orbit space of a saturated fusion system after Steinberg
Abstract: Recently, Steinberg used discrete Morse theory to give a new proof of a theorem of Symonds that the orbit space of the poset of nontrivial $p$-subgroups of a finite group is contractible. We extend Steinberg's argument in two ways, covering more general versions of the theorem that were already known. In particular, following a strategy of Libman, we give a discrete Morse theoretic argument for the contractibility of the orbit space of a saturated fusion system. | math | 0 |
Title: Continual Learning: Forget-free Winning Subnetworks for Video Representations
Abstract: Inspired by the Lottery Ticket Hypothesis (LTH), which highlights the existence of efficient subnetworks within larger, dense networks, a high-performing Winning Subnetwork (WSN) in terms of task performance under appropriate sparsity conditions is considered for various continual learning tasks. It leverages pre-existing weights from dense networks to achieve efficient learning in Task Incremental Learning (TIL) scenarios. In Few-Shot Class Incremental Learning (FSCIL), a variation of WSN referred to as the Soft subnetwork (SoftNet) is designed to prevent overfitting when the data samples are scarce. Furthermore, the sparse reuse of WSN weights is considered for Video Incremental Learning (VIL). The use of Fourier Subneural Operator (FSO) within WSN is considered. It enables compact encoding of videos and identifies reusable subnetworks across varying bandwidths. We have integrated FSO into different architectural frameworks for continual learning, including VIL, TIL, and FSCIL. Our comprehensive experiments demonstrate FSO's effectiveness, significantly improving task performance at various convolutional representational levels. Specifically, FSO enhances higher-layer performance in TIL and FSCIL and lower-layer performance in VIL | cs | 0 |
Title: Ramsey and Turán numbers of sparse hypergraphs
Abstract: Degeneracy plays an important role in understanding Tur\'an- and Ramsey-type properties of graphs. Unfortunately, the usual hypergraphical generalization of degeneracy fails to capture these properties. We define the skeletal degeneracy of a $k$-uniform hypergraph as the degeneracy of its $1$-skeleton (i.e., the graph formed by replacing every $k$-edge by a $k$-clique). We prove that skeletal degeneracy controls hypergraph Tur\'an and Ramsey numbers in a similar manner to (graphical) degeneracy. Specifically, we show that $k$-uniform hypergraphs with bounded skeletal degeneracy have linear Ramsey number. This is the hypergraph analogue of the Burr-Erd\H{o}s conjecture (proved by Lee). In addition, we give upper and lower bounds of the same shape for the Tur\'an number of a $k$-uniform $k$-partite hypergraph in terms of its skeletal degeneracy. The proofs of both results use the technique of dependent random choice. In addition, the proof of our Ramsey result uses the `random greedy process' introduced by Lee in his resolution of the Burr-Erd\H{o}s conjecture. | math | 0 |
Title: Matching of Users and Creators in Two-Sided Markets with Departures
Abstract: Many online platforms of today, including social media sites, are two-sided markets bridging content creators and users. Most of the existing literature on platform recommendation algorithms largely focuses on user preferences and decisions, and does not simultaneously address creator incentives. We propose a model of content recommendation that explicitly focuses on the dynamics of user-content matching, with the novel property that both users and creators may leave the platform permanently if they do not experience sufficient engagement. In our model, each player decides to participate at each time step based on utilities derived from the current match: users based on alignment of the recommended content with their preferences, and creators based on their audience size. We show that a user-centric greedy algorithm that does not consider creator departures can result in arbitrarily poor total engagement, relative to an algorithm that maximizes total engagement while accounting for two-sided departures. Moreover, in stark contrast to the case where only users or only creators leave the platform, we prove that with two-sided departures, approximating maximum total engagement within any constant factor is NP-hard. We present two practical algorithms, one with performance guarantees under mild assumptions on user preferences, and another that tends to outperform algorithms that ignore two-sided departures in practice. | cs | 0 |
Title: Determinants of Circulant Matrices with Some Certain Sequences
Abstract: Let $\{a_k\}$ be a sequence of real numbers defined by an $m$th order linear homogenous recurrence relation. In this paper we obtain a determinant formula for the circulant matrix $A=circ(a_1, a_2, \cdots, a_n)$, providing a generalization of determinantal results in papers of Bozkurt \cite{Bozkurt}, Bozkurt and Tam \cite{BozkurtTam}, and Shen, et al. \cite{ShenCenHao}. | math | 1 |
Title: Probability-graphons: Limits of large dense weighted graphs
Abstract: We introduce probability-graphons which are probability kernels that generalize graphons to the case of weighted graphs. Probability-graphons appear as the limit objects to study sequences of large weighted graphs whose distribution of subgraph sampling converge. The edge-weights are taken from a general Polish space, which also covers the case of decorated graphs. Here, graphs can be either directed or undirected. Starting from a distance $d_m$ inducing the weak topology on measures, we define a cut distance on probability-graphons, making it a Polish space, and study the properties of this cut distance. In particular, we exhibit a tightness criterion for probability-graphons related to relative compactness in the cut distance. We also prove that under some conditions on the distance $d_m$, which are satisfied for some well-know distances like the Prohorov distance, and the Fortet-Mourier and Kantorovitch-Rubinstein norms, the topology induced by the cut distance on the spaceof probability-graphons is independent from the choice of $d_m$. Eventually, we prove that this topology coincides with the topology induced by the convergence in distribution of the sampled subgraphs. | cs | 0 |
Title: Fit-NGP: Fitting Object Models to Neural Graphics Primitives
Abstract: Accurate 3D object pose estimation is key to enabling many robotic applications that involve challenging object interactions. In this work, we show that the density field created by a state-of-the-art efficient radiance field reconstruction method is suitable for highly accurate and robust pose estimation for objects with known 3D models, even when they are very small and with challenging reflective surfaces. We present a fully automatic object pose estimation system based on a robot arm with a single wrist-mounted camera, which can scan a scene from scratch, detect and estimate the 6-Degrees of Freedom (DoF) poses of multiple objects within a couple of minutes of operation. Small objects such as bolts and nuts are estimated with accuracy on order of 1mm. | cs | 0 |
Title: Bounded Derivations on Uniform Roe Algebras
Abstract: We show that if $C_u^*(X)$ is a uniform Roe algebra associated to a bounded geometry metric space X, then all bounded derivations on $C^*_u(X)$ are inner. | math | 1 |
Title: A Geometry-Sensitive Approach for Photographic Style Classification
Abstract: Photographs are characterized by different compositional attributes like the Rule of Thirds, depth of field, vanishing-lines etc. The presence or absence of one or more of these attributes contributes to the overall artistic value of an image. In this work, we analyze the ability of deep learning based methods to learn such photographic style attributes. We observe that although a standard CNN learns the texture and appearance based features reasonably well, its understanding of global and geometric features is limited by two factors. First, the data-augmentation strategies (cropping, warping, etc.) distort the composition of a photograph and affect the performance. Secondly, the CNN features, in principle, are translation-invariant and appearance-dependent. But some geometric properties important for aesthetics, e.g. the Rule of Thirds (RoT), are position-dependent and appearance-invariant. Therefore, we propose a novel input representation which is geometry-sensitive, position-cognizant and appearance-invariant. We further introduce a two-column CNN architecture that performs better than the state-of-the-art (SoA) in photographic style classification. From our results, we observe that the proposed network learns both the geometric and appearance-based attributes better than the SoA. | cs | 1 |
Title: Ground state and nodal solutions for fractional Orlicz problems with lack of regularity and without the Ambrosetti-Rabinowitz condition
Abstract: We consider a non-local Shr\"odinger problem driven by the fractional Orlicz g-Laplace operator as follows \begin{equation}\label{PP} (-\triangle_{g})^{\alpha}u+g(u)=K(x)f(x,u),\ \ \text{in}\ \mathbb{R}^{d},\tag{P} \end{equation} where $d\geq 3,\ (-\triangle_{g})^{\alpha}$ is the fractional Orlicz g-Laplace operator, $f:\mathbb{R}^d\times\mathbb{R}\rightarrow \mathbb{R}$ is a measurable function and $K$ is a positive continuous function. Employing the Nehari manifold method and without assuming the well-known Ambrosetti-Rabinowitz and differentiability conditions on the non-linear term $f$, we prove that the problem \eqref{PP} has a ground state of fixed sign and a nodal (or sign-changing) solutions. | math | 1 |
Title: Recourse under Model Multiplicity via Argumentative Ensembling (Technical Report)
Abstract: Model Multiplicity (MM) arises when multiple, equally performing machine learning models can be trained to solve the same prediction task. Recent studies show that models obtained under MM may produce inconsistent predictions for the same input. When this occurs, it becomes challenging to provide counterfactual explanations (CEs), a common means for offering recourse recommendations to individuals negatively affected by models' predictions. In this paper, we formalise this problem, which we name recourse-aware ensembling, and identify several desirable properties which methods for solving it should satisfy. We show that existing ensembling methods, naturally extended in different ways to provide CEs, fail to satisfy these properties. We then introduce argumentative ensembling, deploying computational argumentation to guarantee robustness of CEs to MM, while also accommodating customisable user preferences. We show theoretically and experimentally that argumentative ensembling satisfies properties which the existing methods lack, and that the trade-offs are minimal wrt accuracy. | cs | 0 |
Title: Quadratic relations of the deformed $W$-algebra
Abstract: The deformed $W$-algebra is a quantum deformation of the $W$-algebra ${\cal W}_\beta(\mathfrak{g})$ in conformal field theory. Using the free field construction, we obtain a closed set of quadratic relations of the $W$-currents of the deformed $W$-algebra. This allows us to define the deformed $W$-algebra by generators and relations. In this review, we study two types of deformed $W$-algebra. One is the deformed $W$-algebra ${\cal W}_{x,r}\big(A_{2N}^{(2)}\big)$, and the other is the $q$-deformed corner vertex algebra $q$-$Y_{L_1, L_2, L_3}$ that is a generalization of the deformed $W$-algebra ${\cal W}_{x,r}\big(A(M,N)^{(1)}\big)$ via the quantum toroidal algebra. | math | 0 |
Title: An upper bound on the size of avoidance couplings
Abstract: We show that a coupling of non-colliding simple random walkers on the complete graph on $n$ vertices can include at most $n - \log n$ walkers. This improves the only previously known upper bound of $n-2$ due to Angel, Holroyd, Martin, Wilson, and Winkler ({\it Electron.~Commun.~Probab.~18}, 2013). The proof considers couplings of i.i.d.~sequences of Bernoulli random variables satisfying a similar avoidance property, for which there is separate interest. Our bound in this setting should be closer to optimal. | math | 1 |
Title: Derivatives of symplectic eigenvalues and a Lidskii type theorem
Abstract: Associated with every $2n\times 2n$ real positive definite matrix $A,$ there exist $n$ positive numbers called the symplectic eigenvalues of $A,$ and a basis of $\mathbb{R}^{2n}$ called the symplectic eigenbasis of $A$ corresponding to these numbers. In this paper, we discuss the differentiability (analyticity) of the symplectic eigenvalues and corresponding symplectic eigenbasis for differentiable (analytic) map $t\mapsto A(t),$ and compute their derivatives. We then derive an analogue of Lidskii's theorem for symplectic eigenvalues as an application. | math | 1 |
Title: Online Learning for Network Constrained Demand Response Pricing in Distribution Systems
Abstract: Flexible demand response (DR) resources can be leveraged to accommodate the stochasticity of some distributed energy resources. This paper develops an online learning approach that continuously estimates price sensitivities of residential DR participants and produces such price signals to the DR participants that ensure a desired level of DR capacity. The proposed learning approach incorporates the dispatch decisions on DR resources into the distributionally robust chance-constrained optimal power flow (OPF) framework. This integration is shown to adequately remunerate DR resources and co-optimize the dispatch of DR and conventional generation resources. The distributionally robust chance-constrained formulation only relies on empirical data acquired over time and makes no restrictive assumptions on the underlying distribution of the demand uncertainty. The distributional robustness also allows for robustifying the optimal solution against systematically misestimating empirically learned parameters. The effectiveness of the proposed learning approach is shown via numerical experiments. The paper is accompanied by the code and data supplement released for public use, see [27]. | cs | 1 |
Title: High-Fidelity Diffusion-based Image Editing
Abstract: Diffusion models have attained remarkable success in the domains of image generation and editing. It is widely recognized that employing larger inversion and denoising steps in diffusion model leads to improved image reconstruction quality. However, the editing performance of diffusion models tends to be no more satisfactory even with increasing denoising steps. The deficiency in editing could be attributed to the conditional Markovian property of the editing process, where errors accumulate throughout denoising steps. To tackle this challenge, we first propose an innovative framework where a rectifier module is incorporated to modulate diffusion model weights with residual features, thereby providing compensatory information to bridge the fidelity gap. Furthermore, we introduce a novel learning paradigm aimed at minimizing error propagation during the editing process, which trains the editing procedure in a manner similar to denoising score-matching. Extensive experiments demonstrate that our proposed framework and training strategy achieve high-fidelity reconstruction and editing results across various levels of denoising steps, meanwhile exhibits exceptional performance in terms of both quantitative metric and qualitative assessments. Moreover, we explore our model's generalization through several applications like image-to-image translation and out-of-domain image editing. | cs | 0 |
Title: Aggregation-diffusion phenomena: from microscopic models to free boundary problems
Abstract: This paper reviews (and expands) some recent results on the modeling of aggregation-diffusion phenomena at various scales, focusing on the emergence of collective dynamics as a result of the competition between attractive and repulsive phenomena - especially (but not exclusively) in the context of attractive chemotaxis phenomena. At microscopic scales, particles (or other agents) are represented by spheres of radius $\delta>0$ and we discuss both soft-sphere models (with a pressure term penalizing the overlap of the particles) and hard-sphere models (in which overlap is prohibited). The first case leads to so-called ``blob models" which have received some attention recently as a tool to approximate non-linear diffusion by particle systems. The hard-sphere model is similar to a classical model for congested crowd motion. We review well-posedness results for these models and discuss their relationship to classical continuum description of aggregation-diffusion phenomena in the limit $\delta\to0$: the classical nonlinear drift diffusion equation and its incompressible counterpart. In the second part of the paper, we discuss recent results on the emergence and evolution of sharp interfaces when a large population of particles is considered at appropriate space and time scales: At some intermediate time scale, phase separation occurs and a sharp interface appears which evolves according to a Stefan free boundary problem (and the density function eventually relaxes to a characteristic function - metastable steady state for the original problem). At a larger time scale the attractive forces lead to surface tension phenomena and the evolution of the sharp interface can be described by a Hele-Shaw free boundary problem with surface tension. At that same time scale, we will also discuss the emergence of contact angle conditions for problems set in bounded domains. | math | 0 |
Title: Van der Corput and metric theorems for geometric progressions for self-similar measures
Abstract: We prove a van der Corput lemma for non-atomic self-similar measures $\mu$. As an application, we show that the correlations of all finite orders of $( x^n \mod 1 )_{n\geq 1}$ converge to the Poissonian model for $\mu$-a.e. $x$, assuming $x>1$. We also complete a recent result of Algom, Rodriguez Hertz, and Wang (obtained simultaneously by Baker and Banaji), showing that any self-conformal measure with respect to a non-affine real analytic IFS has polynomial Fourier decay. | math | 0 |
Title: Notes on limits of accessible categories
Abstract: Let $\kappa$ be a regular cardinal, $\lambda<\kappa$ be a smaller infinite cardinal, and $\mathsf K$ be a $\kappa$-accessible category where colimits of $\lambda$-indexed chains exist. We show that various category-theoretic constructions applied to $\mathsf K$, such as the inserter and the equifier, produce $\kappa$-accessible categories $\mathsf E$ again, and the most obvious expected description of the full subcategory of $\kappa$-presentable objects in $\mathsf E$ in terms of $\kappa$-presentable objects in $\mathsf K$ holds true. In particular, if $\mathsf C$ is a $\kappa$-small category, then the category of functors $\mathsf C\rightarrow\mathsf K$ is $\kappa$-accessible, and its $\kappa$-presentable objects are precisely all the functors from $\mathsf C$ to the $\kappa$-presentable objects of $\mathsf K$. We proceed to discuss the preservation of $\kappa$-accessibility by conical pseudolimits, lax and oplax limits, and weighted pseudolimits. The results of this paper go back to an unpublished 1977 preprint of Ulmer. Our motivation comes from the theory of flat modules and flat quasi-coherent sheaves. | math | 0 |
Title: Learning nonlinear level sets for dimensionality reduction in function approximation
Abstract: We developed a Nonlinear Level-set Learning (NLL) method for dimensionality reduction in high-dimensional function approximation with small data. This work is motivated by a variety of design tasks in real-world engineering applications, where practitioners would replace their computationally intensive physical models (e.g., high-resolution fluid simulators) with fast-to-evaluate predictive machine learning models, so as to accelerate the engineering design processes. There are two major challenges in constructing such predictive models: (a) high-dimensional inputs (e.g., many independent design parameters) and (b) small training data, generated by running extremely time-consuming simulations. Thus, reducing the input dimension is critical to alleviate the over-fitting issue caused by data insufficiency. Existing methods, including sliced inverse regression and active subspace approaches, reduce the input dimension by learning a linear coordinate transformation; our main contribution is to extend the transformation approach to a nonlinear regime. Specifically, we exploit reversible networks (RevNets) to learn nonlinear level sets of a high-dimensional function and parameterize its level sets in low-dimensional spaces. A new loss function was designed to utilize samples of the target functions' gradient to encourage the transformed function to be sensitive to only a few transformed coordinates. The NLL approach is demonstrated by applying it to three 2D functions and two 20D functions for showing the improved approximation accuracy with the use of nonlinear transformation, as well as to an 8D composite material design problem for optimizing the buckling-resistance performance of composite shells of rocket inter-stages. | math | 1 |
Title: Posets, Tensor Products and Schur positivity
Abstract: Let g be a complex finite-dimensional simple Lie algebra. Given a positive integer k and a dominant weight \lambda, we define a preorder on the set $P(\lambda, k)$ of k-tuples of dominant weights which add up to \lambda. Let $P(\lambda, k)/\sim$ be the corresponding poset of equivalence classes defined by the preorder. We show that if \lambda is a multiple of a fundamental weight (and k is general) or if k=2 (and \lambda is general), then $P(\lambda, k)/\sim$ coincides with the set of S_k-orbits in $P(\lambda,k)$, where S_k acts on $P(\lambda, k)$ as the permutations of components. If g is of type A_n and k=2, we show that the S_2-orbit of the row shuffle defined by Fomin et al is the unique maximal element in the poset. Given an element of $P(\lambda, k)$, consider the tensor product of the corresponding simple finite-dimensional g-modules. We show that (for general g, \lambda, and k) the dimension of this tensor product increases along with the partial order. We also show that in the case when \lambda is a multiple of a fundamental minuscule weight (g and k are general) or if g is of type A_2 and k=2 (\lambda is general), there exists an inclusion of tensor products of g-modules along with the partial order. In particular, if g is of type A_n, this means that the difference of the characters is Schur positive. | math | 1 |
Title: Packing graphs of bounded codegree
Abstract: Two graphs $G_1$ and $G_2$ on $n$ vertices are said to pack if there exist injective mappings of their vertex sets into $[n]$ such that the images of their edge sets are disjoint. A longstanding conjecture due to Bollob\'as and Eldridge and, independently, Catlin, asserts that, if $(\Delta_1(G)+1) (\Delta_2(G)+1) \le n+1$, then $G_1$ and $G_2$ pack. We consider the validity of this assertion under the additional assumption that $G_1$ or $G_2$ has bounded codegree. In particular, we prove for all $t \ge 2$ that, if $G_1$ contains no copy of the complete bipartite graph $K_{2,t}$ and $\Delta_1 > 17 t \cdot \Delta_2$, then $(\Delta_1(G)+1) (\Delta_2(G)+1) \le n+1$ implies that $G_1$ and $G_2$ pack. We also provide a mild improvement if moreover $G_2$ contains no copy of the complete tripartite graph $K_{1,1,s}$, $s\ge 1$. | math | 1 |
Title: A PDE approach for solving the characteristic function of the generalised signature process
Abstract: The signature of a path, as a fundamental object in Rough path theory, serves as a generating function for non-communicative monomials on path space. It transforms the path into a grouplike element in the tensor algebra space, summarising the path faithfully up to a generalised form of re-parameterisation (a negligible equivalence class in this context). Our paper concerns stochastic processes and studies the characteristic function of the path signature of the stochastic process. In contrast to the expected signature, it determines the law on the random signatures without any regularity condition. The computation of the characteristic function of the random signature offers potential applications in stochastic analysis and machine learning, where the expected signature plays an important role. In this paper, we focus on a time-homogeneous It\^o diffusion process, and adopt a PDE approach to derive the characteristic function of its signature defined at any fixed time horizon. A key ingredient of our approach is the introduction of the generalised-signature process. This lifting enables us to establish the Feynman-Kac-type theorem for the characteristic function of the generalised-signature process by following the martingale approach. Moreover, as an application of our results, we present a novel derivation of the joint characteristic function of Brownian motion coupled with the L\'evy area, leveraging the structure theorem of anti-symmetric matrices. | math | 0 |
Title: Normal subgroups and relative centers of linearly reductive quantum groups
Abstract: We prove a number of structural and representation-theoretic results on linearly reductive quantum groups, i.e. objects dual to that of cosemisimple Hopf algebras: (a) a closed normal quantum subgroup is automatically linearly reductive if its squared antipode leaves invariant each simple subcoalgebra of the underlying Hopf algebra; (b) for a normal embedding $\mathbb{H}\trianglelefteq \mathbb{G}$ there is a Clifford-style correspondence between two equivalence relations on irreducible $\mathbb{G}$- and, respectively, $\mathbb{H}$-representations; and (c) given an embedding $\mathbb{H}\le \mathbb{G}$ of linearly reductive quantum groups the Pontryagin dual of the relative center $Z(\mathbb{G})\cap \mathbb{H}$ can be described by generators and relations, with one generator $g_V$ for each irreducible $\mathbb{G}$-representation $V$ and one relation $g_U=g_Vg_W$ whenever $U$ and $V\otimes W$ are not disjoint over $\mathbb{H}$. This latter center-reconstruction result generalizes and recovers M\"uger's compact-group analogue and the author's quantum-group version of that earlier result by setting $\mathbb{H}=\mathbb{G}$. | math | 1 |
Title: On the complexity of the generalized Q2R automaton
Abstract: We study the dynamic and complexity of the generalized Q2R automaton. We show the existence of non-polynomial cycles as well as its capability to simulate with the synchronous update the classical version of the automaton updated under a block sequential update scheme. Furthermore, we show that the decision problem consisting in determine if a given node in the network changes its state is \textbf{P}-Hard. | cs | 1 |
Title: Gaussian Process based Stochastic Model Predictive Control for Cooperative Adaptive Cruise Control
Abstract: Cooperative driving relies on communication among vehicles to create situational awareness. One application of cooperative driving is Cooperative Adaptive Cruise Control (CACC) that aims at enhancing highway transportation safety and capacity. Model-based communication (MBC) is a new paradigm with a flexible content structure for broadcasting joint vehicle-driver predictive behavioral models. The vehicle's complex dynamics and diverse driving behaviors add complexity to the modeling process. Gaussian process (GP) is a fully data-driven and non-parametric Bayesian modeling approach which can be used as a modeling component of MBC. The knowledge about the uncertainty is propagated through predictions by generating local GPs for vehicles and broadcasting their hyper-parameters as a model to the neighboring vehicles. In this research study, GP is used to model each vehicle's speed trajectory, which allows vehicles to access the future behavior of their preceding vehicle during communication loss and/or low-rate communication. Besides, to overcome the safety issues in a vehicle platoon, two operating modes for each vehicle are considered; free following and emergency braking. This paper presents a discrete hybrid stochastic model predictive control, which incorporates system modes as well as uncertainties captured by GP models. The proposed control design approach finds the optimal vehicle speed trajectory with the goal of achieving a safe and efficient platoon of vehicles with small inter-vehicle gap while reducing the reliance of the vehicles on a frequent communication. Simulation studies demonstrate the efficacy of the proposed controller considering the aforementioned communication paradigm with low-rate intermittent communication. | cs | 1 |
Title: Definability of continuous isomorphisms of groups definable in o-minimal expansions of the real field
Abstract: In this paper, we study the relation between the category of real Lie groups and that of groups definable in o-minimal expansions of the real field (which we will refer to as "definable groups"). It is known (\cite{Pi88}) that any group definable in an o-minimal expansion of the real field is a Lie group, and in \cite{COP} a complete characterization of when a Lie group has a "definable group" which is \emph{Lie isomorphic} to it was given. We continue the analysis by explaining when a Lie homomorphism between definable groups is a definable isomorphism. Among other things, we prove that in any o-minimal expansion $\mathcal R$ of the real field we can add a function symbol for any Lie isomorphism between definable groups to the language of $\mathcal R$ preserving o-minimality, and that any definable group $G$ can be endowed with an analytic manifold structure definable in $\mathcal R_{\text{Pfaff}}$ that makes it an analytic group. | math | 0 |
Title: Fiber criteria for flatness and homomorphisms of flat affine group schemes
Abstract: A very useful result concerning flatness in Algebraic Geometry is EGA's ``fiber'' criterion. We propose similar fiber criteria to verify flatness of a module while avoiding ``finiteness'' assumptions. Motivated by a Tannakian viewpoint (where the category of representations comes to the front), we derive applications to the theory of affine and flat group schemes. | math | 0 |
Title: Decomposable and atomic projection maps
Abstract: It is shown that a trace invariant projection map, i.e. a positive unital idempotent map, of a finite dimensional C*-algebra into itself is non-decomposable if and only if it is atomic, or equivalently not the sum of a 2-positive and a 2-copositive map. In particular projections onto spin factors of dimension greater than 6 are atomic. | math | 1 |
Title: Absolute continuity of the limiting eigenvalue distribution of the random Toeplitz matrix
Abstract: We show that the limiting eigenvalue distribution of random symmetric Toeplitz matrices is absolutely continuous with density bounded by 8, partially answering a question of Bryc, Dembo and Jiang (2006). The main tool used in the proof is a spectral averaging technique from the theory of random Schr\"{o}dinger operators. The similar question for Hankel matrices remains open. | math | 1 |
Title: Speeding Up Distributed Machine Learning Using Codes
Abstract: Codes are widely used in many engineering applications to offer robustness against noise. In large-scale systems there are several types of noise that can affect the performance of distributed machine learning algorithms -- straggler nodes, system failures, or communication bottlenecks -- but there has been little interaction cutting across codes, machine learning, and distributed systems. In this work, we provide theoretical insights on how coded solutions can achieve significant gains compared to uncoded ones. We focus on two of the most basic building blocks of distributed learning algorithms: matrix multiplication and data shuffling. For matrix multiplication, we use codes to alleviate the effect of stragglers, and show that if the number of homogeneous workers is $n$, and the runtime of each subtask has an exponential tail, coded computation can speed up distributed matrix multiplication by a factor of $\log n$. For data shuffling, we use codes to reduce communication bottlenecks, exploiting the excess in storage. We show that when a constant fraction $\alpha$ of the data matrix can be cached at each worker, and $n$ is the number of workers, \emph{coded shuffling} reduces the communication cost by a factor of $(\alpha + \frac{1}{n})\gamma(n)$ compared to uncoded shuffling, where $\gamma(n)$ is the ratio of the cost of unicasting $n$ messages to $n$ users to multicasting a common message (of the same size) to $n$ users. For instance, $\gamma(n) \simeq n$ if multicasting a message to $n$ users is as cheap as unicasting a message to one user. We also provide experiment results, corroborating our theoretical gains of the coded algorithms. | cs | 1 |
Title: One-sided reflected Brownian motions and the KPZ fixed point
Abstract: We consider the system of one-sided reflected Brownian motions which is in variational duality with Brownian last passage percolation. We show that it has integrable transition probabilities, expressed in terms of Hermite polynomials and hitting times of exponential random walks, and that it converges in the 1:2:3 scaling limit to the KPZ fixed point, the scaling invariant Markov process defined in [MQR17] and believed to govern the long time large scale fluctuations for all models in the KPZ universality class. Brownian last passage percolation was shown recently in [DOV18] to converge to the Airy sheet (or directed landscape), defined there as a strong limit of a functional of the Airy line ensemble. This establishes the variational formula for the KPZ fixed point in terms of the Airy sheet. | math | 1 |
Title: Spectral conditions for factor-criticality of graphs
Abstract: A graph $G$ is $k$-factor-critical if $G-S$ has a perfect matching for any $k$-subset $S$ of the vertex set of $G$. In this paper, we investigate the factor-criticality of graphs with fixed minimum degree and provide sufficient conditions for such graphs to be $k$-factor-critical in terms of spectral radius and signless Laplacian spectral radius. | math | 0 |
Title: DGDNN: Decoupled Graph Diffusion Neural Network for Stock Movement Prediction
Abstract: Forecasting future stock trends remains challenging for academia and industry due to stochastic inter-stock dynamics and hierarchical intra-stock dynamics influencing stock prices. In recent years, graph neural networks have achieved remarkable performance in this problem by formulating multiple stocks as graph-structured data. However, most of these approaches rely on artificially defined factors to construct static stock graphs, which fail to capture the intrinsic interdependencies between stocks that rapidly evolve. In addition, these methods often ignore the hierarchical features of the stocks and lose distinctive information within. In this work, we propose a novel graph learning approach implemented without expert knowledge to address these issues. First, our approach automatically constructs dynamic stock graphs by entropy-driven edge generation from a signal processing perspective. Then, we further learn task-optimal dependencies between stocks via a generalized graph diffusion process on constructed stock graphs. Last, a decoupled representation learning scheme is adopted to capture distinctive hierarchical intra-stock features. Experimental results demonstrate substantial improvements over state-of-the-art baselines on real-world datasets. Moreover, the ablation study and sensitivity study further illustrate the effectiveness of the proposed method in modeling the time-evolving inter-stock and intra-stock dynamics. | cs | 0 |
Title: Robust Physics Informed Neural Networks
Abstract: We introduce a Robust version of the Physics-Informed Neural Networks (RPINNs) to approximate the Partial Differential Equations (PDEs) solution. Standard Physics Informed Neural Networks (PINN) takes into account the governing physical laws described by PDE during the learning process. The network is trained on a data set that consists of randomly selected points in the physical domain and its boundary. PINNs have been successfully applied to solve various problems described by PDEs with boundary conditions. The loss function in traditional PINNs is based on the strong residuals of the PDEs. This loss function in PINNs is generally not robust with respect to the true error. The loss function in PINNs can be far from the true error, which makes the training process more difficult. In particular, we do not know if the training process has already converged to the solution with the required accuracy. This is especially true if we do not know the exact solution, so we cannot estimate the true error during the training. This paper introduces a different way of defining the loss function. It incorporates the residual and the inverse of the Gram matrix, computed using the energy norm. We test our RPINN algorithm on two Laplace problems and one advection-diffusion problem in two spatial dimensions. We conclude that RPINN is a robust method. The proposed loss coincides well with the true error of the solution, as measured in the energy norm. Thus, we know if our training process goes well, and we know when to stop the training to obtain the neural network approximation of the solution of the PDE with the true error of required accuracy. | cs | 0 |
Title: Controllability of evolution equations with memory
Abstract: This article is devoted to studying the null controllability of evolution equations with memory terms. The problem is challenging not only because the state equation contains memory terms but also because the classical controllability requirement at the final time has to be reinforced, involving the contribution of the memory term, to ensure that the solution reaches the equilibrium. Using duality arguments, the problem is reduced to the obtention of suitable observability estimates for the adjoint system. We first consider finite-dimensional dynamical systems involving memory terms and derive rank conditions for controllability. Then the null controllability property is established for some parabolic equations with memory terms, by means of Carleman estimates. | math | 1 |
Title: Index concepts for linear differential-algebraic equations in finite and infinite dimensions
Abstract: Different index concepts for linear differential-algebraic equations are defined in the general Banach space setting, and compared. For regular finite-dimensional linear differential-algebraic equations, all these indices exist and are equivalent. For infinite-dimensional systems, the situation is more complex. It is proven that although some indices imply others, in general they are not equivalent. The situation is illustrated with a number of examples. | math | 0 |
Title: A rewriting-logic-with-SMT-based formal analysis and parameter synthesis framework for parametric time Petri nets
Abstract: This paper presents a concrete and a symbolic rewriting logic semantics for parametric time Petri nets with inhibitor arcs (PITPNs), a flexible model of timed systems where parameters are allowed in firing bounds. We prove that our semantics is bisimilar to the "standard" semantics of PITPNs. This allows us to use the rewriting logic tool Maude, combined with SMT solving, to provide sound and complete formal analyses for PITPNs. We develop and implement a new general folding approach for symbolic reachability, so that Maude-with-SMT reachability analysis terminates whenever the parametric state-class graph of the PITPN is finite. Our work opens up the possibility of using the many formal analysis capabilities of Maude -- including full LTL model checking, analysis with user-defined analysis strategies, and even statistical model checking -- for such nets. We illustrate this by explaining how almost all formal analysis and parameter synthesis methods supported by the state-of-the-art PITPN tool Romeo can be performed using Maude with SMT. In addition, we also support analysis and parameter synthesis from parametric initial markings, as well as full LTL model checking and analysis with user-defined execution strategies. Experiments show that our methods outperform Romeo in many cases. | cs | 0 |
Title: The spectrality of self-affine measure under the similarity transformation of $GL_n(p)$
Abstract: Let $\mu_{M,D}$ be the self-affine measure generated by an expanding integer matrix $M\in M_n(\mathbb{Z})$ and a finite digit set $D\subset\mathbb{Z}^n$. It is well known that the two measures $\mu_{M,D}$ and $\mu_{\tilde{M},\tilde{D}}$ have the same spectrality if $\tilde{M}=B^{-1}MB$ and $\tilde{D}=B^{-1}D$, where $B\in M_n(\mathbb{R})$ is a nonsingular matrix. This fact is usually used to simplify the digit set $D$ or the expanding matrix $M$. However, it often transforms integer digit set $D$ or expanding matrix $M$ into real, which brings many difficulties to study the spectrality of $\mu_{\tilde{M},\tilde{D}}$. In this paper, we introduce a similarity transformation of general linear group $GL_n(p)$ for some self-affine measures, and discuss their spectrality. This kind of similarity transformation can keep the integer properties of $D$ and $M$ simultaneously, which leads to many advantages in discussing the spectrality of self-affine measures. As an application, we extend some well-known spectral self-affine measures to more general forms. | math | 1 |
Title: Two point concentration of maximum degree in sparse random planar graphs
Abstract: Let $P(n,m)$ be a graph chosen uniformly at random from the class of all planar graphs on vertex set $\left\{1, \ldots, n\right\}$ with $m=m(n)$ edges. We show that in the sparse regime, when $\limsup_{n \to \infty} m/n<1$, with high probability the maximum degree of $P(n,m)$ takes at most two different values. | math | 1 |
Title: Polynomial Fourier decay for fractal measures and their pushforwards
Abstract: We prove that the pushforwards of a very general class of fractal measures $\mu$ on $\mathbb{R}^d$ under a large family of non-linear maps $F \colon \mathbb{R}^d \to \mathbb{R}$ exhibit polynomial Fourier decay: there exist $C,\eta>0$ such that $|\widehat{F\mu}(\xi)|\leq C|\xi|^{-\eta}$ for all $\xi\neq 0$. Using this, we prove that if $\Phi = \{ \varphi_a \colon [0,1] \to [0,1] \}_{a \in \mathcal{A}}$ is an iterated function system consisting of analytic contractions, and there exists $a \in \mathcal{A}$ such that $\varphi_a$ is not an affine map, then every non-atomic self-conformal measure for $\Phi$ has polynomial Fourier decay; this result was obtained simultaneously by Algom, Rodriguez Hertz, and Wang. We prove applications related to the Fourier uniqueness problem, Fractal Uncertainty Principles, and normal numbers in fractal sets. | math | 0 |
Title: Higher Order Model Checking in Isabelle for Human Centric Infrastructure Security
Abstract: In this paper we present an efficient approach to implementing model checking in the Higher Order Logic (HOL) of Isabelle. This is a non-trivial task since model checking is restricted to finite state sets. By restricting our scope to considering security attacks, we achieve an efficient executable specification of a model checking algorithm for attack trees. We provide the existing background, the necessary theory and illustrate its application. Theory and application are fully formalized in Isabelle thus providing an executable model checking algorithm. | cs | 0 |
Title: Improved Adversarial Systems for 3D Object Generation and Reconstruction
Abstract: This paper describes a new approach for training generative adversarial networks (GAN) to understand the detailed 3D shape of objects. While GANs have been used in this domain previously, they are notoriously hard to train, especially for the complex joint data distribution over 3D objects of many categories and orientations. Our method extends previous work by employing the Wasserstein distance normalized with gradient penalization as a training objective. This enables improved generation from the joint object shape distribution. Our system can also reconstruct 3D shape from 2D images and perform shape completion from occluded 2.5D range scans. We achieve notable quantitative improvements in comparison to existing baselines | cs | 1 |
Title: Comultiplication for shifted Yangians and quantum open Toda lattice
Abstract: We study a coproduct in type A quantum open Toda lattice in terms of a coproduct in the shifted Yangian of sl_2. At the classical level this corresponds to the multiplication of scattering matrices of euclidean SU(2) monopoles. We also study coproducts for shifted Yangians for any simply-laced Lie algebra. | math | 1 |
Title: A phase field formulation for hydrogen assisted cracking
Abstract: We present a phase field modeling framework for hydrogen assisted cracking. The model builds upon a coupled mechanical and hydrogen diffusion response, driven by chemical potential gradients, and a hydrogen-dependent fracture energy degradation law grounded on first principles calculations. The coupled problem is solved in an implicit time integration scheme, where displacements, phase field order parameter and hydrogen concentration are the primary variables. We show that phase field formulations for fracture are particularly suitable to capture material degradation due to hydrogen. Specifically, we model (i) unstable crack growth in the presence of hydrogen, (ii) failure stress sensitivity to hydrogen content in notched specimens, (iii) cracking thresholds under constant load, (iv) internal hydrogen assisted fracture in cracked specimens, and (v) complex crack paths arising from corrosion pits. Computations reveal a good agreement with experiments, highlighting the predictive capabilities of the present scheme. The work could have important implications for the prediction and prevention of catastrophic failures in corrosive environments. The finite element code developed can be downloaded from www.empaneda.com/codes | math | 1 |
Title: On the first two eigenvalues of regular graphs
Abstract: Let $G$ be a regular graph with $m$ edges, and let $\mu_1, \mu_2$ denote the two largest eigenvalues of $A_G$, the adjacency matrix of $G$. We show that, if $G$ is not complete, then $$\mu_1^2 + \mu_2^2 \leq \frac{2(\omega - 1)}{\omega} m$$ where $\omega$ is the clique number of $G$. This confirms a conjecture of Bollob\'{a}s and Nikiforov for regular graphs. We also show that equality holds if and only if $G$ is either a balanced Tur\'{a}n graph or the disjoint union of two balanced Tur\'{a}n graphs of the same size. | math | 0 |
Title: Implementation Notes for the Soft Cosine Measure
Abstract: The standard bag-of-words vector space model (VSM) is efficient, and ubiquitous in information retrieval, but it underestimates the similarity of documents with the same meaning, but different terminology. To overcome this limitation, Sidorov et al. proposed the Soft Cosine Measure (SCM) that incorporates term similarity relations. Charlet and Damnati showed that the SCM is highly effective in question answering (QA) systems. However, the orthonormalization algorithm proposed by Sidorov et al. has an impractical time complexity of $\mathcal O(n^4)$, where n is the size of the vocabulary. In this paper, we prove a tighter lower worst-case time complexity bound of $\mathcal O(n^3)$. We also present an algorithm for computing the similarity between documents and we show that its worst-case time complexity is $\mathcal O(1)$ given realistic conditions. Lastly, we describe implementation in general-purpose vector databases such as Annoy, and Faiss and in the inverted indices of text search engines such as Apache Lucene, and ElasticSearch. Our results enable the deployment of the SCM in real-world information retrieval systems. | cs | 1 |
Title: On the total disconnectedness of the quotient Aubry set
Abstract: In this paper we show that the quotient Aubry set associated to certain Lagrangians is totally disconnected (i.e., every connected component consists of a single point). Moreover, we discuss the relation between this problem and a Morse-Sard type property for (difference of) critical subsolutions of Hamilton-Jacobi equations. | math | 1 |