English
Related papers

Related papers: Bounding Taylor approximation errors for the expon…

200 papers

In this work we develop a scalable computational framework for the solution of PDE-constrained optimal control under high-dimensional uncertainty. Specifically, we consider a mean-variance formulation of the control objective and employ a…

Optimization and Control · Mathematics 2019-03-27 Peng Chen , Umberto Villa , Omar Ghattas

Despite many applications, dimensionality reduction in the $\ell_1$-norm is much less understood than in the Euclidean norm. We give two new oblivious dimensionality reduction techniques for the $\ell_1$-norm which improve exponentially…

Data Structures and Algorithms · Computer Science 2021-08-09 Yi Li , David P. Woodruff , Taisuke Yasuda

Let $(X_{i}, \mathcal{F}_{i})_{i\geq 1}$ be a sequence of supermartingale differences and let $S_k=\sum_{i=1}^k X_i$. We give an exponential moment condition under which $P(\max_{1\leq k \leq n} S_k \geq n)=O(\exp\{-C_1 n^{\alpha}\}),$…

Probability · Mathematics 2013-05-07 Xiequan Fan , Ion Grama , Quansheng Liu

Motivated by the study of the maximal operator for the Schr\"{o}dinger equation on the one-dimensional torus $ \mathbb{T}^1 $, it is conjectured that for any complex sequence $ \{b_n\}_{n=1}^N $, $$ \left\| \sup_{t\in [0,N^2]}…

Classical Analysis and ODEs · Mathematics 2023-07-25 Yuqiu Fu , Kevin Ren , Haoyu Wang

We consider an insurance company modelling its surplus process by a Brownian motion with drift. Our target is to maximise the expected exponential utility of discounted dividend payments, given that the dividend rates are bounded by some…

Risk Management · Quantitative Finance 2019-01-23 Julia Eisenberg , Paul Krühner

We establish weak-type $(1,1)$ bounds for the maximal function associated with ergodic averaging operators modeled on a wide class of thin deterministic sets $B$. As a corollary we obtain the corresponding pointwise convergence result on…

Classical Analysis and ODEs · Mathematics 2023-05-19 Leonidas Daskalakis

In this paper, we provide the first deterministic algorithm that achieves the tight $1-1/e$ approximation guarantee for submodular maximization under a cardinality (size) constraint while making a number of queries that scales only linearly…

Data Structures and Algorithms · Computer Science 2022-04-13 Wenxin Li , Moran Feldman , Ehsan Kazemi , Amin Karbasi

The research problem in this work is the relaxation of maximizing non-negative submodular plus modular with the entire real number domain as its value range over a family of down-closed sets. We seek a feasible point $\mathbf{x}^*$ in the…

Data Structures and Algorithms · Computer Science 2022-04-13 Xin Sun , Chenchen Wu , Dachuan Xu , Yang Zhou

In this paper, we aim to develop stochastic hard thresholding algorithms for the important problem of AUC maximization in imbalanced classification. The main challenge is the pairwise loss involved in AUC maximization. We overcome this…

Machine Learning · Computer Science 2020-11-05 Zhenhuan Yang , Baojian Zhou , Yunwen Lei , Yiming Ying

Popular iterative algorithms such as boosting methods and coordinate descent on linear models converge to the maximum $\ell_1$-margin classifier, a.k.a. sparse hard-margin SVM, in high dimensional regimes where the data is linearly…

Machine Learning · Statistics 2023-01-23 Stefan Stojanovic , Konstantin Donhauser , Fanny Yang

Generalized linear mixed models are powerful tools for analyzing clustered data, where the unknown parameters are classically (and most commonly) estimated by the maximum likelihood and restricted maximum likelihood procedures. However,…

Statistics Theory · Mathematics 2023-03-23 Andrea M. Bratsberg , Magne Thoresen , Abhik Ghosh

It is well known that, under standard regularity conditions, the maximum likelihood estimator (MLE) satisfies a central limit theorem and converges in distribution to a Gaussian random variable as the sample size grows. This paper…

Information Theory · Computer Science 2026-05-26 Leighton P. Barnes , Alex Dytso

In this paper, we present a thorough study of maximizing a regularized non-monotone submodular function subject to various constraints, i.e., $\max \{ g(A) - \ell(A) : A \in \mathcal{F} \}$, where $g \colon 2^\Omega \to \mathbb{R}_+$ is a…

Data Structures and Algorithms · Computer Science 2021-03-19 Cheng Lu , Wenguo Yang , Suixiang Gao

We study the problem of Regularized Unconstrained Submodular Maximization (RegularizedUSM) as defined by Bodek and Feldman [BF22]. In this problem, you are given a non-monotone non-negative submodular function $f:2^{\mathcal N}\to \mathbb…

Data Structures and Algorithms · Computer Science 2022-06-01 Benjamin Qi

The $S$-functional calculus is based on the theory of slice hyperholomorphic functions and it defines functions of $n$-tuples of not necessarily commuting operators or of quaternionic operators. This calculus relays on the notion of…

Functional Analysis · Mathematics 2016-09-21 Fabrizio Colombo , Jonathan Gantner

We study reinforcement learning with linear function approximation where the transition probability and reward functions are linear with respect to a feature mapping $\boldsymbol{\phi}(s,a)$. Specifically, we consider the episodic…

Machine Learning · Computer Science 2023-01-31 Pihe Hu , Yu Chen , Longbo Huang

We prove a theorem for the growth of the energy of bounded, globally minimizing solutions to a class of semilinear elliptic systems of the form $\Delta u=\nabla W(u)$, $x\in \mathbb{R}^n$, $n\geq 2$, with $W:\mathbb{R}^m\to \mathbb{R}$,…

Analysis of PDEs · Mathematics 2014-04-09 Christos Sourdis

We consider the steady fractional Schr\"odinger equation $L u + V u = f$ posed on a bounded domain $\Omega$; $L$ is an integro-differential operator, like the usual versions of the fractional Laplacian $(-\Delta)^s$; $V\ge 0$ is a potential…

Analysis of PDEs · Mathematics 2019-12-02 David Gómez-Castro , Juan Luis Vázquez

To recover the topology of a manifold in the presence of heavy tailed or exponentially decaying noise, one must understand the behavior of geometric complexes whose points lie in the tail of these noise distributions. This study advances…

Probability · Mathematics 2021-02-16 Andrew M. Thomas , Takashi Owada

We consider the problem of estimating a function $s$ on $[-1,1]^{k}$ for large values of $k$ by looking for some best approximation by composite functions of the form $g\circ u$. Our solution is based on model selection and leads to a very…

Statistics Theory · Mathematics 2013-01-29 Yannick Baraud , Lucien Birgé
‹ Prev 1 3 4 5 6 7 10 Next ›