arXiv research

The paper explores the geometric structure of cost functions in multiple dimensions.

We generalize Demailly's construction of projective jet bundles and strictly negatively curved pseudometrics on them to the logarithmic case. We establish this logarithmic generalization explicitly via coordinates, just as Noguchi's generalization of the jets used by Green-Griffiths. As a first application, we give a m…

We design a randomised parallel version of Adaboost based on previous studies on parallel coordinate descent. The algorithm uses the fact that the logarithm of the exponential loss is a function with coordinate-wise Lipschitz continuous gradient, in order to define the step lengths. We provide the proof of convergence …

Study of foliations' geometric and topological structures.

A new subdivision scheme for Heisenberg group values with central smoothness loss.

The paper constructs a Saito basis for a specific class of divisors and applies it to logarithmic Poisson geometry.

Paper optimizes approximating high-dimensional diffusions by independent coordinates.

Algorithm reduces regret in multi-player bandits with unknown collision rewards.

New algorithm improves privacy in high-dimensional machine learning models.

We study the problem of regret minimization for distributed bandits learning, in which $M$ agents work collaboratively to minimize their total regret under the coordination of a central server. Our goal is to design communication protocols with near-optimal regret and little communication cost, which is measured by the…

The paper classifies affine minimal translation surfaces and finds their properties.

PolarBM models complex-valued audio signals in polar coordinates, improving over conventional methods.

Paper proposes FedQ-Advantage for federated Q-learning with near-optimal regret and low communication cost.

Optimizes variational inference for dynamic network models.

We consider a variant of online convex optimization in which both the instances (input vectors) and the comparator (weight vector) are unconstrained. We exploit a natural scale invariance symmetry in our unconstrained setting: the predictions of the optimal comparator are invariant under any linear transformation of th…

We give a new, very general, formulation of the compressed sensing problem in terms of coordinate projections of an analytic variety, and derive sufficient sampling rates for signal reconstruction. Our bounds are linear in the coherence of the signal space, a geometric parameter independent of the specific signal and m…

In this paper we develop a randomized block-coordinate descent method for minimizing the sum of a smooth and a simple nonsmooth block-separable convex function and prove that it obtains an $ε$-accurate solution with probability at least $1-ρ$ in at most $O(\tfrac{n}ε \log \tfrac{1}ρ)$ iterations, where $n$ is the numbe…

Two non-communicating players minimize regret in a multi-armed bandit game.

Paper details Hilbert-curve for high-performance data mining.

AIHT improves online high-dimensional quantile regression by separating support discovery and refinement.

New framework improves EM algorithm convergence under log-Sobolev inequality.

In this paper, we give an easy proof of the main results of Andrews and Clutterbuck's paper [J. Amer. Math. Soc. 24 (2011), no. 3, 899--916], which gives both a sharp lower bound for the spectral gap of a Schröinger operator and a sharp modulus of concavity for the logarithm of the corresponding first eigenfunction. We…

Sharp sample complexity for multiclass PAC learning with bandit feedback.

High-dimensional models trained on smooth manifolds achieve optimal rates in Wasserstein metrics.

We study multiplayer stochastic multi-armed bandit problems in which the players cannot communicate and if two or more players pull the same arm, a collision occurs and the involved players receive zero reward. We consider two feedback models: a model in which the players can observe whether a collision has occurred an…

This paper is focused on geometric aspects of two particular types of finite-variable reductions in the dispersionless Toda hierarchy. The reductions are formulated in terms of "Landau-Ginzburg potentials" that play the role of reduced Lax functions. One of them is a generalization of Dubrovin and Zhang's trigonometric…

In this paper, we introduce the notions of logarithmic Poisson structure and logarithmic principal Poisson structure; we prove that the latter induces a representation by logarithmic derivation of the module of logarithmic Kahler differentials; therefore, it induces a differential complex from which we derive the notio…

Algorithm learns optimal coordination for strategic agents in uncertain settings.

A new coordinate system for SPD matrices simplifies computations and generative modeling.

Federated Q-Learning achieves linear regret speedup with low communication cost.

Study rigidity by logarithmic capacity and related functions.

Study real logarithms of semi-simple matrices, focusing on differential structure.

Study excess logarithmic residues for foliations to bound invariant hypersurfaces and test log canonicity.

Logarithmic connections on principal bundles over normal varieties are studied.

We present a new method to solve certain $\bar{\partial}$-equations for logarithmic differential forms by using harmonic integral theory for currents on Kahler manifolds. The result can be considered as a $\bar{\partial}$-lemma for logarithmic forms. As applications, we generalize the result of Deligne about closedness…

Local logarithmic Brunn-Minkowski holds for zonoids.

New framework for logarithmically divergent integrals on manifolds with corners.

Directly proves logarithmic systolic growth for all hyperbolic surfaces.

Logarithmic separation profile in hyperbolic groups shows hierarchical structure.

Paper uses ABP method to prove logarithmic Sobolev inequalities on curved spaces.

Investment and consumption strategy optimized under uncertain conditions.

This paper is a sequel of arxiv:1709.09045 and deals with privileged coordinates and nilpotent approximation of Carnot manifolds. By a Carnot manifold it is meant a manifold equipped with a filtration by subbundles of the tangent bundle which is compatible with the Lie bracket of vector fields. In this paper, we single…

The false discovery rate (FDR)---the expected fraction of spurious discoveries among all the discoveries---provides a popular statistical assessment of the reproducibility of scientific studies in various disciplines. In this work, we introduce a new method for controlling the FDR in meta-analysis of many decentralized…

Extended logarithm for solvable elements in mapping class groups.

In this work, we give a formula for the logarithmic invariant of knots in terms of certain derivatives of the colored Jones invariant. This invariant is related to the logarithmic conformal field theory, and was defined by using the centers in the radical of the restricted quantum group at root of unity. A relation bet…

Study of conformal logarithmic Laplacian on sphere, connecting Yamabe problems and Sobolev spaces.

Coordinate descent methods usually minimize a cost function by updating a random decision variable (corresponding to one coordinate) at a time. Ideally, we would update the decision variable that yields the largest decrease in the cost function. However, finding this coordinate would require checking all of them, which…

Paper finds necessary condition for logarithmic Minkowski problem in higher dimensions.