Suchergebnisse - "Math Applications in Computer Science"

Stochastic Subgradient Method Converges on Tame Functions von Davis, Damek, Drusvyatskiy, Dmitriy, Kakade, Sham, Lee, Jason D.

“… This work considers the question: what convergence guarantees does the stochastic subgradient method have in the absence of smoothness and convexity? We prove …”
Volltext

Mean Estimation and Regression Under Heavy-Tailed Distributions: A Survey von Lugosi, Gábor, Mendelson, Shahar

“… We survey some of the recent advances in mean estimation and regression function estimation. In particular, we describe sub-Gaussian mean estimators for …”
Volltext

A Geometric Analysis of Phase Retrieval von Sun, Ju, Qu, Qing, Wright, John

“… Can we recover a complex signal from its Fourier magnitudes? More generally, given a set of m measurements, y k = a k ∗ x for k = 1 , … , m , is it possible to …”
Volltext

On the Sample Complexity of the Linear Quadratic Regulator von Dean, Sarah, Mania, Horia, Matni, Nikolai, Recht, Benjamin, Tu, Stephen

“… This paper addresses the optimal control problem known as the linear quadratic regulator in the case when the dynamics are unknown. We propose a multistage …”
Volltext

A Theoretical and Empirical Comparison of Gradient Approximations in Derivative-Free Optimization von Berahas, Albert S., Cao, Liyuan, Choromanski, Krzysztof, Scheinberg, Katya

“… In this paper, we analyze several methods for approximating gradients of noisy functions using only function values. These methods include finite differences, …”
Volltext

Random Gradient-Free Minimization of Convex Functions von Nesterov, Yurii, Spokoiny, Vladimir

“… In this paper, we prove new complexity bounds for methods of convex optimization based only on computation of the function value. The search directions of our …”
Volltext

Error Estimates for Spectral Convergence of the Graph Laplacian on Random Geometric Graphs Toward the Laplace–Beltrami Operator von García Trillos, Nicolás, Gerlach, Moritz, Hein, Matthias, Slepčev, Dejan

“… We study the convergence of the graph Laplacian of a random geometric graph generated by an i.i.d. sample from a m -dimensional submanifold M in R d as the …”
Volltext

Fifty years of Hoare’s logic von Apt, Krzysztof R., Olderog, Ernst-Rüdiger

“… We present a history of Hoare’s logic …”
Volltext

Adaptive Restart for Accelerated Gradient Schemes von O’Donoghue, Brendan, Candès, Emmanuel

“… In this paper we introduce a simple heuristic adaptive restart technique that can dramatically improve the convergence rate of accelerated gradient schemes …”
Volltext

Optimal Abatement Technology Licensing in a Dynamic Transboundary Pollution Game: Fixed Fee Versus Royalty von Xu, Hao, Tan, Deqing

“… Transboundary pollution poses a major threat to environment and human health. An effective approach to addressing this problem is the adoption of long-term …”
Volltext

Calculus of the Exponent of Kurdyka–Łojasiewicz Inequality and Its Applications to Linear Convergence of First-Order Methods von Li, Guoyin, Pong, Ting Kei

“… In this paper, we study the Kurdyka–Łojasiewicz (KL) exponent, an important quantity for analyzing the convergence rate of first-order methods. Specifically, …”
Volltext

Extracting Appropriate Nodal Marginal Prices for All Types of Committed Reserve von Akbary, Paria, Ghiasi, Mohammad, Pourkheranjani, Mohammad Reza Rezaie, Alipour, Hamidreza, Ghadimi, Noradin

“… This paper proposes a framework to extract appropriate locational marginal prices for each type of reserve (up-/down-going reserves at both generation- and …”
Volltext

Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem von Christofides, Nicos

“… An O( n 3 ) heuristic algorithm is described for solving d -city travelling salesman problems (TSP) whose cost matrix satisfies the triangularity condition …”
Volltext

Implicit Regularization in Nonconvex Statistical Estimation: Gradient Descent Converges Linearly for Phase Retrieval, Matrix Completion, and Blind Deconvolution von Ma, Cong, Wang, Kaizheng, Chi, Yuejie, Chen, Yuxin

“… Recent years have seen a flurry of activities in designing provably efficient nonconvex procedures for solving statistical estimation problems. Due to the …”
Volltext

Function Values Are Enough for L2-Approximation von Krieg, David, Ullrich, Mario

“… We study the L 2 -approximation of functions from a Hilbert space and compare the sampling numbers with the approximation numbers. The sampling number e n is …”
Volltext

Complexes from Complexes von Arnold, Douglas N., Hu, Kaibo

“… This paper is concerned with the derivation and properties of differential complexes arising from a variety of problems in differential equations, with …”
Volltext

Explainable Machine Learning in Credit Risk Management von Bussmann, Niklas, Giudici, Paolo, Marinelli, Dimitri, Papenbrock, Jochen

“… The paper proposes an explainable Artificial Intelligence model that can be used in credit risk management and, in particular, in measuring the risks that …”
Volltext

User-Friendly Tail Bounds for Sums of Random Matrices von Tropp, Joel A.

“… This paper presents new probability inequalities for sums of independent, random, self-adjoint matrices. These results place simple and easily verifiable …”
Volltext

Bankruptcy Prediction using the XGBoost Algorithm and Variable Importance Feature Engineering von Ben Jabeur, Sami, Stef, Nicolae, Carmona, Pedro

“… The emergence of big data, information technology, and social media provides an enormous amount of information about firms’ current financial health. When …”
Volltext

An Interpolating Distance Between Optimal Transport and Fisher–Rao Metrics von Chizat, Lénaïc, Peyré, Gabriel, Schmitzer, Bernhard, Vialard, François-Xavier

“… This paper defines a new transport metric over the space of nonnegative measures. This metric interpolates between the quadratic Wasserstein and the Fisher–Rao …”
Volltext