A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
New model of vague knowledge without strict partitions or transitivity.
Analysts use vague language in reports to convey useful information about future payoffs.
Adversarial meta-learning computes Gamma-minimax estimators for vague prior knowledge.
We discuss fun problems, vaguely related to notions and theorems of a course in differential geometry. This paper can be regarded as a weekend "treasure chest" supplementing the course weekday lecture notes. The problems and solutions are not original, while their relation to the course might be so.
We have developed an efficient algorithm for the maximum likelihood joint tracking and association problem in a strong clutter for GMTI data. By using an iterative procedure of the dynamic logic process "from vague-to-crisp," the new tracker overcomes combinatorial complexity of tracking in highly-cluttered scenarios a…
We shall prove that under some volume growth condition, the essential spectrum of the Laplacian contains the interval if an -dimensional Riemannian manifold has an end and the average of the part of the Ricci curvature on the end which lies below a nonpositive constant converges to ze…
Review of uncertainty representation methods in risk management.
A dictionary connects symplectic to contact geometry, with applications to complex and G-structures.
Random hyperbolic 3-manifolds can be obtained via Dehn surgery.
Study shows HFT benefits large traders under certain conditions.
In shape analysis, the concept of shape spaces has always been vague, requiring a case-by-case approach for every new type of shape. In this paper, we give a general definition for an abstract space of shapes in a manifold. This notion encompasses every shape space studied so far in the literature, and offers a rigorou…
Review of priors in Bayesian deep learning models.
The present work investigates whether different quantification mechanisms (set comparison, vague quantification, and proportional estimation) can be jointly learned from visual scenes by a multi-task computational model. The motivation is that, in humans, these processes underlie the same cognitive, non-symbolic abilit…
Deep neural networks (DNNs) are known as black-box models. In other words, it is difficult to interpret the internal state of the model. Improving the interpretability of DNNs is one of the hot research topics. However, at present, the definition of interpretability for DNNs is vague, and the question of what is a high…
QLSTM outperforms LSTM in predicting KSE 100 index movements.
Unified framework for intersectionally fair AI models using MIO.
In an earlier paper we introduced rectangular diagrams of surfaces and showed that any isotopy class of a surface in the three-sphere can be presented by a rectangular diagram. Here we study transformations of those diagrams and introduce moves that allow transition between diagrams representing isotopic surfaces. We a…
In this paper, we derive a Bayesian model order selection rule by using the exponentially embedded family method, termed Bayesian EEF. Unlike many other Bayesian model selection methods, the Bayesian EEF can use vague proper priors and improper noninformative priors to be objective in the elicitation of parameter prior…
Convolutional neural networks (CNNs) in recent years have made a dramatic impact in science, technology and industry, yet the theoretical mechanism of CNN architecture design remains surprisingly vague. The CNN neurons, including its distinctive element, convolutional filters, are known to be learnable features, yet th…
A complex-valued convolutional network (convnet) implements the repeated application of the following composition of three operations, recursively applying the composition to an input vector of nonnegative real numbers: (1) convolution with complex-valued vectors followed by (2) taking the absolute value of every entry…
For a long time, designing neural architectures that exhibit high performance was considered a dark art that required expert hand-tuning. One of the few well-known guidelines for architecture design is the avoidance of exploding gradients, though even this guideline has remained relatively vague and circumstantial. We …
New framework shows ERM is optimal for both interpolation and extrapolation in domain generalization.
Study finds no significant difference in neural network weights with quantum random numbers.
Variational inference has become one of the most widely used methods in latent variable modeling. In its basic form, variational inference employs a fully factorized variational distribution and minimizes its KL divergence to the posterior. As the minimization can only be carried out approximately, this approximation i…
Bayesian deep learning improves neural network accuracy and generalization.
Recent advances in deep pose estimation models have proven to be effective in a wide range of applications such as health monitoring, sports, animations, and robotics. However, pose estimation models fail to generalize when facing images acquired from in-bed pressure sensing systems. In this paper, we address this chal…
DSNAS optimizes neural architecture and parameters in one step.
A new framework maximizes influence spread in social networks by accounting for inter-community diffusion.
We introduce the concept of community trees that summarizes topological structures within a network. A community tree is a tree structure representing clique communities from the clique percolation method (CPM). The community tree also generates a persistent diagram. Community trees and persistent diagrams reveal topol…
Community detection improves stock market portfolio optimization.
We introduce a new paradigm that is important for community detection in the realm of network analysis. Networks contain a set of strong, dominant communities, which interfere with the detection of weak, natural community structure. When most of the members of the weak communities also belong to stronger communities, t…
Study exact community detection in k-community Gaussian mixtures with different intensities.
The paper introduces a method for detecting principal communities and embedding vertices.
Improved distributed learning with reduced communication costs.
New method samples Jeffreys prior for objective Bayesian inference.
The paper tackles model collapse in GPLVMs by improving kernel flexibility and projection variance.
Statistical estimates can often be improved by fusion of data from several different sources. One example is so-called ensemble methods which have been successfully applied in areas such as machine learning for classification and clustering. In this paper, we present an ensemble method to improve community detection by…
Semantic code search is the task of retrieving relevant code given a natural language query. While related to other information retrieval tasks, it requires bridging the gap between the language used in code (often abbreviated and highly technical) and natural language more suitable to describe vague concepts and ideas…
MACC learns communication protocols by adapting counterfactual reasoning.
A novel framework for adaptive multi-agent communication in reinforcement learning.
A framework for multi-agent communication over noisy channels in reinforcement learning.
Discovering community structure in complex networks is a mature field since a tremendous number of community detection methods have been introduced in the literature. Nevertheless, it is still very challenging for practioners to determine which method would be suitable to get insights into the structural information of…
The analysis of temporal networks has a wide area of applications in a world of technological advances. An important aspect of temporal network analysis is the discovery of community structures. Real data networks are often very large and the communities are observed to have a hierarchical structure referred to as mult…
Real-world networks usually have community structure, that is, nodes are grouped into densely connected communities. Community detection is one of the most popular and best-studied research topics in network science and has attracted attention in many different fields, including computer science, statistics, social sci…
GRADE models evolving graph dynamics by learning node and community representations.
Paper studies fundamental limits of communication in distributed learning.
Study recovers community structure from coarse graph measurements.
New algorithm reduces communication traffic in decentralized learning.