arXiv research

PDNAS optimizes GNN architectures for diverse datasets.

Paper develops a dual formulation for PCA in Hilbert spaces.

We propose networked exponential families to jointly leverage the information in the topology as well as the attributes (features) of networked data points. Networked exponential families are a flexible probabilistic model for heterogeneous datasets with intrinsic network structure. These models can be learnt efficient…

New insights into risk aversion for complex decision models.

Many supervised learning tasks are emerged in dual forms, e.g., English-to-French translation vs. French-to-English translation, speech recognition vs. text to speech, and image classification vs. image generation. Two dual tasks have intrinsic connections with each other due to the probabilistic correlation between th…

GPs with neural network dual kernels improve reinforcement learning performance.

Paper proposes a dual-level approach for multi-step forecasting of dynamical systems.

Develops probabilistic models for gene regulatory network inference.

We consider a general path-dependent version of the hedging problem with price impact of Bouchard et al. (2019), in which a dual formulation for the super-hedging price is obtained by means of PDE arguments, in a Markovian setting and under strong regularity conditions. Using only probabilistic arguments, we prove, in …

Sum-product networks have recently emerged as an attractive representation due to their dual view as a special type of deep neural network with clear semantics and a special type of probabilistic graphical model for which inference is always tractable. Those properties follow from some conditions (i.e., completeness an…

Scalable solver reduces PDE uncertainty with active learning.

Probabilistic deep learning uses neural networks and models to handle uncertainty.

Study dual representations for quasiconvex systemic risk measures.

Modern deep neural networks are well known to be brittle in the face of unknown data instances and recognition of the latter remains a challenge. Although it is inevitable for continual-learning systems to encounter such unseen concepts, the corresponding literature appears to nonetheless focus primarily on alleviating…

A new method for faster optimization on statistical manifolds.

Consider a feedforward neural network $ψ: \mathbb{R}^d\rightarrow \mathbb{R}^d$ such that $ψ\approx \nabla f$, where $f:\mathbb{R}^d \rightarrow \mathbb{R}$ is a smooth function, therefore $ψ$ must satisfy $\partial_j ψ_i = \partial_i ψ_j$ pointwise. We prove a theorem that a $ψ$ network with more than one hidden layer…

Dual Variable Learning Rates improve neural network training efficiency.

The pricing, hedging, optimal exercise and optimal cancellation of game or Israeli options are considered in a multi-currency model with proportional transaction costs. Efficient constructions for optimal hedging, cancellation and exercise strategies are presented, together with numerical examples, as well as probabili…

Dual PC algorithm improves structure learning of Bayesian networks.

We consider infinite dimensional optimization problems motivated by the financial model called Arbitrage Pricing Theory. Using probabilistic and functional analytic tools, we provide a dual characterization of the super-replication cost. Then, we show the existence of optimal strategies for investors maximizing their e…

PNCs balance tractability and expressiveness in probabilistic modeling.

Develops a non-parametric Dirichlet process method for probabilistic biclustering.

DS-UI improves DNN uncertainty inference by combining a DNN classifier with MoGMM.

CPFM integrates dimensionality reduction and reconstruction with flow networks.

In this paper, computer-based techniques for stylistic analysis of paintings are applied to the five panels of the 14th century Peruzzi Altarpiece by Giotto di Bondone. Features are extracted by combining a dual-tree complex wavelet transform with a hidden Markov tree (HMT) model. Hierarchical clustering is used to ide…

Optimizes wireless network resource management with state-augmented policies.

Unified Kantorovich duality for multimarginal optimal transport on Polish spaces.

DCCNNs reduce computational overhead and ambiguity in convolutional neural networks.

The wavelet transform has seen success when incorporated into neural network architectures, such as in wavelet scattering networks. More recently, it has been shown that the dual-tree complex wavelet transform can provide better representations than the standard transform. With this in mind, we extend our previous meth…

Recent advances in statistical inference have significantly expanded the toolbox of probabilistic modeling. Historically, probabilistic modeling has been constrained to (i) very restricted model classes where exact or approximate probabilistic inference were feasible, and (ii) small or medium-sized data sets which fit …

Binarization of digital documents is the task of classifying each pixel in an image of the document as belonging to the background (parchment/paper) or foreground (text/ink). Historical documents are often subjected to degradations, that make the task challenging. In the current work a deep neural network architecture …

ProFnet models HDFTS with neural networks, offering scalable probabilistic forecasts.

We consider the robust exponential utility maximization problem in discrete time: An investor maximizes the worst case expected exponential utility with respect to a family of nondominated probabilistic models of her endowment by dynamically investing in a financial market, and statically in available options. We show …

Even though probabilistic treatments of neural networks have a long history, they have not found widespread use in practice. Sampling approaches are often too slow already for simple networks. The size of the inputs and the depth of typical CNN architectures in computer vision only compound this problem. Uncertainty in…

This paper introduces the probabilistic module interface, which allows encapsulation of complex probabilistic models with latent variables alongside custom stochastic approximate inference machinery, and provides a platform-agnostic abstraction barrier separating the model internals from the host probabilistic inferenc…

InferPy is a Python package for probabilistic modeling with deep neural networks. It defines a user-friendly API that trades-off model complexity with ease of use, unlike other libraries whose focus is on dealing with very general probabilistic models at the cost of having a more complex API. In particular, this packag…

We develop a general duality between neural networks and compositional kernels, striving towards a better understanding of deep learning. We show that initial representations generated by common random initializations are sufficiently rich to express all functions in the dual kernel space. Hence, though the training ob…

Training energy-based probabilistic models is confronted with apparently intractable sums, whose Monte Carlo estimation requires sampling from the estimated probability distribution in the inner loop of training. This can be approximately achieved by Markov chain Monte Carlo methods, but may still face a formidable obs…

Hybrid Bayesian neural networks use function uncertainty for probabilistic inference.

Convex dual network improves neural network reconstruction for medical imaging.

Generative networks minimize predictive scoring rules for probabilistic forecasting.

Generalized dual discriminator GANs improve upon traditional GANs by using two discriminators and a flexible loss function.

Probabilistic modeling enables combining domain knowledge with learning from data, thereby supporting learning from fewer training instances than purely data-driven methods. However, learning probabilistic models is difficult and has not achieved the level of performance of methods such as deep neural networks on many …

Correlation Networks (CNs) inherently suffer from redundant information in their network topology. Bayesian Networks (BNs), on the other hand, include only non-redundant information (from a probabilistic perspective) resulting in a sparse topology from which generalizable physical features can be extracted. We advocate…

Mamba improves time series forecasting by quantifying uncertainty.

Study stability of contingent claim solutions under probabilistic perturbations.

Dual regularized graph Laplacian improves spectral clustering for community detection.

We study dual-based algorithms for distributed convex optimization problems over networks, where the objective is to minimize a sum $\sum_{i=1}^{m}f_i(z)$ of functions over in a network. We provide complexity bounds for four different cases, namely: each function $f_i$ is strongly convex and smooth, each function is ei…