Research
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

0111 · Dec 201019922001200920172026
15 results for convex-dual

Convex dual network improves neural network reconstruction for medical imaging.

problem Non-convex nature of neural networks hinders their use in sensitive applications.
method Introduces a convex duality framework for a two-layer fully-convolutional ReLU denoising network.
result Training neural networks with weight decay regularization induces path sparsity and piecewise linear filtering.

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…

2010-12-02abs ↗pdf ↗

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…

2018-12-28abs ↗pdf ↗

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…

2012-06-20abs ↗pdf ↗

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…

2012-07-11abs ↗pdf ↗

Unified framework for non-negative matrices and tensors using Wasserstein loss.

problem Finding low-dimensional representations of high-dimensional datasets with non-negative constraints.
method Unified mathematical framework with a smoothed Wasserstein loss, convex dual formulation for efficient computation.
result Efficient solution for non-negative matrix and tensor factorisations with 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…

2015-03-04abs ↗pdf ↗

Develops risk measures for markets with constraints and costs.

problem Risk measures in markets with portfolio constraints and transaction costs.
method Embeds portfolio constraints and transaction costs into securities market; provides comprehensive analysis of risk measures properties.
result Establishes dual representations for convex and quasiconvex risk measures.

A new method reduces the computational burden of safety alignment for large language models.

problem Safety concerns in large language models and the need to align them with human preferences.
method Optimal dualization approach to reduce constrained alignment to an unconstrained problem.
result Our algorithms MoCAN and PeCAN significantly reduce computational burden and improve training stability.

Let σt(x)σ_t(x) denote the implied volatility at maturity tt for a strike K=S0extK=S_0 e^{xt}, where $x\in\bbR$ and S0S_0 is the current value of the underlying. We show that σt(x)σ_t(x) has a uniform (in xx) limit as maturity tt tends to infinity, given by the formula σ(x)=2(h(x)1/2+(h(x)x)1/2)σ_\infty(x)=\sqrt{2}(h^*(x)^{1/2}+(h^*(x)-x)^{1/2}), for…

2011-08-19abs ↗pdf ↗

This paper advances FL algorithms for composite optimization and statistical recovery.

problem Federated learning optimization and statistical recovery in composite settings.
method Proposes Fast Federated Dual Averaging for strongly convex and smooth loss, and Multi-stage Federated Dual Averaging for restricted strongly convex and smooth loss.
result Establishes state-of-the-art iteration and communication complexity, and high probability complexity bound with linear speedup.

Develops scalable Bayesian inference methods for neural networks.

problem Lack of model uncertainty in deep learning leading to overconfident predictions.
method Linearised Laplace approximation, conjugate Gaussian-linear models, stochastic gradient descent, sample-based EM algorithm.
result Equips neural networks with model uncertainty using scalable methods.