The paper extends NUP representations to factor graphs for better estimation.
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.
Trend · papers per month
Convex dual network improves neural network reconstruction for medical imaging.
We study optimal solutions to an abstract optimization problem for measures, which is a generalization of classical variational problems in information theory and statistical physics. In the classical problems, information and relative entropy are defined using the Kullback-Leibler divergence, and for this reason optim…
It is well known that the minimal superhedging price of a contingent claim is too high for practical use. In a continuous-time model uncertainty framework, we consider a relaxed hedging criterion based on acceptable shortfall risks. Combining existing aggregation and convex dual representation theorems, we derive duali…
Inference problems in graphical models are often approximated by casting them as constrained optimization problems. Message passing algorithms, such as belief propagation, have previously been suggested as methods for solving these optimization problems. However, there are few convergence guarantees for such algorithms…
Exponential models of distributions are widely used in machine learning for classiffication and modelling. It is well known that they can be interpreted as maximum entropy models under empirical expectation constraints. In this work, we argue that for classiffication tasks, mutual information is a more suitable informa…
A fast method for training linear classifiers maximizes margins.
Unified framework for non-negative matrices and tensors using Wasserstein loss.
Many machine learning tasks can be formulated in terms of predicting structured outputs. In frameworks such as the structured support vector machine (SVM-Struct) and the structured perceptron, discriminative functions are learned by iteratively applying efficient maximum a posteriori (MAP) decoding. However, maximum li…
Develops risk measures for markets with constraints and costs.
A new method reduces the computational burden of safety alignment for large language models.
Accounting for model uncertainty in risk management and option pricing leads to infinite dimensional optimization problems which are both analytically and numerically intractable. In this article we study when this hurdle can be overcome for the so-called optimized certainty equivalent risk measure (OCE) -- including t…
Let denote the implied volatility at maturity for a strike , where $x\in\bbR$ and is the current value of the underlying. We show that has a uniform (in ) limit as maturity tends to infinity, given by the formula , for…
This paper advances FL algorithms for composite optimization and statistical recovery.
Develops scalable Bayesian inference methods for neural networks.