This paper formalizes a latent variable inference problem we call {\em supervised pattern discovery}, the goal of which is to find sets of observations that belong to a single ``pattern.'' We discuss two versions of the problem and prove uniform risk bounds for both. In the first version, collections of patterns can be…
On-device research index
arXiv research
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.
168,742 papers · 148 categories
Trend · papers per month
48 results for “Arbitrary Patterns”
The work "Loss Landscape Sightseeing with Multi-Point Optimization" (Skorokhodov and Burtsev, 2019) demonstrated that one can empirically find arbitrary 2D binary patterns inside loss surfaces of popular neural networks. In this paper we prove that: (i) this is a general property of deep universal approximators; and (i…
Unified analysis of FL with arbitrary client participation.
problem Challenges of intermittent client availability and efficiency in FL.
method Introduces a generalized FedAvg and novel analysis capturing client participation.
result Unified convergence upper bounds for various participation patterns.
Entry-Specific Matrix Estimation under Arbitrary Sampling Patterns through the Lens of Network Flowsstat.ML
New matrix completion method for arbitrary sampling patterns using network flows.
problem Matrix completion under arbitrary sampling patterns.
method Network flow approach to matrix completion.
result Minimax optimal estimation for individual entries.
Arbitrary style transfer is an important problem in computer vision that aims to transfer style patterns from an arbitrary style image to a given content image. However, current methods either rely on slow iterative optimization or fast pre-determined feature transformation, but at the cost of compromised visual qualit…
This paper proposes a new method for an optimized mapping of temporal variables, describing a temporal stream data, into the recently proposed NeuCube spiking neural network architecture. This optimized mapping extends the use of the NeuCube, which was initially designed for spatiotemporal brain data, to work on arbitr…
In contrast to the standard classification paradigm where the true class is given to each training pattern, complementary-label learning only uses training patterns each equipped with a complementary label, which only specifies one of the classes that the pattern does not belong to. The goal of this paper is to derive …
Necessary and sufficient conditions are given for a satellite knot to be fibered. Any knot embeds in an unknotted solid torus with arbitrary winding number in such a way that no satellite knot with pattern is fibered. In particular, there exist nonfibered satellite knots wit…
The paper tackles entry prediction in row/column-exchangeable matrices with arbitrary missing data.
problem Prediction in matrices with arbitrary missing data.
method Proposes two practical algorithms: one for fast emulation and another for acceleration using algorithmic stability.
result Demonstrates superior performance in synthetic and real-world data sets.
Background: The problem of predicting whether a drug combination of arbitrary orders is likely to induce adverse drug reactions is considered in this manuscript. Methods: Novel kernels over drug combinations of arbitrary orders are developed within support vector machines for the prediction. Graph matching methods are …
PIF detects anomalies in structured patterns using preference embedding.
problem Detecting anomalies with respect to structured patterns.
method PIF combines adaptive isolation methods with preference embedding to compute anomaly scores using a tree-based method, PI-Forest.
result PIF outperforms state-of-the-art techniques in anomaly detection.
The study computes invariants of satellite knots using bordered Floer homology.
problem Computing invariants of satellite knots with specific patterns.
method Using bordered Floer homology and the immersed curve interpretation of the bordered pairing theorem.
result Satellites with thin fibered companions or specific patterns have thin knot Floer homology.
In this paper we continue investigation of the constant astigmatism equation z_{yy} + (1/z)_{xx} + 2 = 0. We newly interpret its solutions as describing spherical orthogonal equiareal patterns, with relevance to two-dimensional plasticity. We show how the classical Bianchi superposition principle for the sine-Gordon eq…
Phase Diagram of Restricted Boltzmann Machines and Generalised Hopfield Networks with Arbitrary Priorscond-mat.dis-nn
Restricted Boltzmann Machines are described by the Gibbs measure of a bipartite spin glass, which in turn corresponds to the one of a generalised Hopfield network. This equivalence allows us to characterise the state of these systems in terms of retrieval capabilities, both at low and high load. We study the paramagnet…
The paper proves neural networks with ReLU and softmax can approximate any function.
problem Approximating functions and class labels in neural networks.
method Extended universal approximator theory to neural networks with ReLU and softmax.
result Neural networks with ReLU and softmax can approximate any function and class labels.
Classification and regression in which the inputs are graphs of arbitrary size and shape have been paid attention in various fields such as computational chemistry and bioinformatics. Subgraph indicators are often used as the most fundamental features, but the number of possible subgraph patterns are intractably large …
Two discretizations, linear and nonlinear, of basic notions of the complex analysis are considered. The underlying lattice is an arbitrary quasicrystallic rhombic tiling of a plane. The linear theory is based on the discrete Cauchy-Riemann equations, the nonlinear one is based on the notion of circle patterns. We clari…
Detects project management anti-patterns using code and issue data.
problem Detecting project management anti-patterns requires expert judgment and is expensive.
method Convert descriptions to detectable metrics, quantify deviations, and optimize patterns.
result Automatic calibration enhances pattern detection and severity assessment.
Anomaly detection has numerous applications and has been studied vastly. We consider a complementary problem that has a much sparser literature: anomaly description. Interpretation of anomalies is crucial for practitioners for sense-making, troubleshooting, and planning actions. To this end, we present a new approach c…
Unordered feature sets are a nonstandard data structure that traditional neural networks are incapable of addressing in a principled manner. Providing a concatenation of features in an arbitrary order may lead to the learning of spurious patterns or biases that do not actually exist. Another complication is introduced …
Multimorbidity, or the presence of several medical conditions in the same individual, has been increasing in the population, both in absolute and relative terms. However, multimorbidity remains poorly understood, and the evidence from existing research to describe its burden, determinants and consequences has been limi…
COP improves online conformal prediction by incorporating data patterns, leading to tighter prediction sets.
problem Overly conservative prediction sets in online conformal prediction methods when data distribution shifts.
method Conformal Optimistic Prediction (COP) incorporating estimated cumulative distribution function of non-conformity scores.
result COP produces tighter prediction sets with valid coverage guarantees, outperforming other methods.
This article presents a new method for forecasting Value at Risk. Convolutional neural networks can do time series forecasting, since they can learn local patterns in time. A simple modification enables them to forecast not the mean, but arbitrary quantiles of the distribution, and thus allows them to be applied to VaR…
To understand the structural dynamics of a large-scale social, biological or technological network, it may be useful to discover behavioral roles representing the main connectivity patterns present over time. In this paper, we propose a scalable non-parametric approach to automatically learn the structural dynamics of …
Flexible Cox model for time-dependent covariates with complex sparsity patterns.
problem Lack of flexibility in enforcing specific sparsity patterns in time-dependent Cox models.
method Proposes a flexible framework for variable selection in time-dependent Cox models, accommodating complex selection rules.
result Achieves accurate estimation with low false alarm rates for complex covariate structures.
We study the problem of learning associative memory -- a system which is able to retrieve a remembered pattern based on its distorted or incomplete version. Attractor networks provide a sound model of associative memory: patterns are stored as attractors of the network dynamics and associative retrieval is performed by…
Proposes PENNs for deep learning with missing data.
problem Deep learning with missing covariates in multivariate nonparametric regression.
method Pattern Embedded Neural Networks (PENNs) combining imputation and neural networks.
result PENNs achieve minimax rate of convergence for typical cases, improving standard neural networks.
In evolving complex systems such as air traffic and social organizations, collective effects emerge from their many components' dynamic interactions. While the dynamic interactions can be represented by temporal networks with nodes and links that change over time, they remain highly complex. It is therefore often neces…
We derive generalized estimators for a number of spatial statistics that have been used in the analysis of spatially resolved omics data, such as Ripley's K, H and L functions, clustering index, and degree of clustering, which allow these statistics to be calculated on data modelled by arbitrary random measures (RMs). …
We study multistep Bayesian betting strategies in coin-tossing games in the framework of game-theoretic probability of Shafer and Vovk (2001). We show that by a countable mixture of these strategies, a gambler or an investor can exploit arbitrary patterns of deviations of nature's moves from independent Bernoulli trial…
ActiLabel learns activity patterns across diverse sensor devices.
problem Limited adoption of activity recognition models across different domains due to diverse sensor devices.
method Combination of graph model and optimal tiered mapping for learning activity labels.
result Superior performance compared to state-of-the-art methods on public datasets.
TOAD-GAN generates coherent game levels from a single example.
problem Creating game levels from a single example.
method Token-based Procedural Content Generation (PCG) using SinGAN architecture.
result Achieves state-of-the-art results in generating coherent levels of similar style.
Technical trading rules and linear regressive models are often used by practitioners to find trends in financial data. However, these models are unsuited to find non-linearly separable patterns. We propose a decision tree forecasting model that has the flexibility to capture arbitrary patterns. To illustrate, we constr…
An explicit formula for the discrete power function associated with circle patterns of Schramm typenlin.SI
We present an explicit formula for the discrete power function introduced by Bobenko, which is expressed in terms of the hypergeometric τfunctions for the sixth Painlevé equation. The original definition of the discrete power function imposes strict conditions on the domain and the value of the exponent. However, we sh…
The last decades have not only been characterized by an explosive growth of data, but also an increasing appreciation of data as a valuable resource. Their value comes with the ability to extract meaningful patterns that are of economic, societal or scientific relevance. A particular challenge is the identification of …
We consider dimensional reduction of gauge theories with arbitrary gauge group in a formalism based on equivariant principal bundles. For the classical gauge groups we clarify the relations between equivariant principal bundles and quiver bundles, and show that the reduced quiver gauge theories are all generically buil…
Modern deep learning approaches have achieved groundbreaking performance in modeling and classifying sequential data. Specifically, attention networks constitute the state-of-the-art paradigm for capturing long temporal dynamics. This paper examines the efficacy of this paradigm in the challenging task of emotion recog…
Sparse Stochastic Zeroth-Order Optimization with an Application to Bandit Structured Predictionstat.ML
Stochastic zeroth-order (SZO), or gradient-free, optimization allows to optimize arbitrary functions by relying only on function evaluations under parameter perturbations, however, the iteration complexity of SZO methods suffers a factor proportional to the dimensionality of the perturbed function. We show that in scen…
We solve image inverse problems using a flow-based noise model.
problem Image inverse problems with complex noise patterns.
method Normalizing flow prior for maximum a posteriori estimation.
result Empirical validation on various inverse problems.
We introduce a new graphical model for tracking radio-tagged animals and learning their movement patterns. The model provides a principled way to combine radio telemetry data with an arbitrary set of userdefined, spatial features. We describe an efficient stochastic gradient algorithm for fitting model parameters to da…
New methods improve convergence in non-convex non-smooth learning problems.
problem Sparse learning from high-dimensional data with non-convex, non-smooth regularizers.
method Stochastic proximal gradient methods with arbitrary sampling.
result Independent sampling improves performance over uniform sampling.
Sparse Transformers can approximate dense Transformers with only O(n) connections.
problem Can sparse Transformers approximate arbitrary sequence-to-sequence functions?
method Proposed sufficient conditions for universal approximation and proved that sparse Transformers with O(n) connections can approximate dense models.
result Sparse Transformers with O(n) connections can approximate the same function class as dense models with n^2 connections.
Diversity or complementarity of experts in ensemble pattern recognition and information processing systems is widely-observed by researchers to be crucial for achieving performance improvement upon fusion. Understanding this link between ensemble diversity and fusion performance is thus an important research question. …
We present a Bayesian formulation of weighted stochastic block models that can be used to infer the large-scale modular structure of weighted networks, including their hierarchical organization. Our method is nonparametric, and thus does not require the prior knowledge of the number of groups or other dimensions of the…
New process explains asset volatility patterns.
problem Explains statistical relationship between asset volatility and returns.
method Uses multiplicative Langevin process with adjustable coherence time.
result Exactly equivalent to Inverse Gamma distribution for volatility.
Although deep convolutional networks have achieved improved performance in many natural language tasks, they have been treated as black boxes because they are difficult to interpret. Especially, little is known about how they represent language in their intermediate layers. In an attempt to understand the representatio…
Missing value imputation is a fundamental problem in spatiotemporal modeling, from motion tracking to the dynamics of physical systems. Deep autoregressive models suffer from error propagation which becomes catastrophic for imputing long-range sequences. In this paper, we take a non-autoregressive approach and propose …
Safe Pattern Pruning reduces pattern explosion in predictive pattern mining.
problem Exponential growth of patterns in structured data.
method Safe Pattern Pruning (SPP) method.
result Effective model building in practical data analysis.