arXiv research

The paper provides tight bounds for improving multi-armed bandits problem.

Develops an efficient approximation for full conformal prediction regions.

Develops a regression approach for solving MDPs with general state and action spaces.

A contact foliation is a foliation endowed with a leafwise contact structure. In this remark we explain a turbulisation procedure that allows us to prove that tightness is not a homotopy invariant property for contact foliations.

Structured prediction is used in areas such as computer vision and natural language processing to predict structured outputs such as segmentations or parse trees. In these settings, prediction is performed by MAP inference or, equivalently, by solving an integer linear program. Because of the complex scoring functions …

Study on maximizing submodular functions with limited updates, achieving tight bounds and poly-time algorithms.

Efficiently private clustering algorithms with tight approximation ratios.

Streaming algorithms are generally judged by the quality of their solution, memory footprint, and computational complexity. In this paper, we study the problem of maximizing a monotone submodular function in the streaming setting with a cardinality constraint $k$. We first propose Sieve-Streaming++, which requires just…

The free energy is a key quantity of interest in Ising models, but unfortunately, computing it in general is computationally intractable. Two popular (variational) approximation schemes for estimating the free energy of general Ising models (in particular, even in regimes where correlation decay does not hold) are: (i)…

Paper develops bounds for stochastic approximation with averaging.

Proposes approximating computationally expensive explainability techniques using conformal regression.

Differentially private (DP) machine learning has recently become popular. The privacy loss of DP algorithms is commonly reported using $(\varepsilon,δ)$-DP. In this paper, we propose a numerical accountant for evaluating the privacy loss for algorithms with continuous one dimensional output. This accountant can be appl…

We study the problem of {\em properly} learning large margin halfspaces in the agnostic PAC model. In more detail, we study the complexity of properly learning $d$-dimensional halfspaces on the unit ball within misclassification error $α\cdot \mathrm{OPT}_γ + ε$, where $\mathrm{OPT}_γ$ is the optimal $γ$-margin error r…

The paper analyzes how gradient descent implicitly regularizes solutions in overparameterized neural networks, revealing depth-dependent regularization effects.

Study analyzes broker's gain from trade in repeated context-based trading.

The current paper studies the problem of agnostic $Q$-learning with function approximation in deterministic systems where the optimal $Q$-function is approximable by a function in the class $\mathcal{F}$ with approximation error $δ\ge 0$. We propose a novel recursion-based algorithm and show that if $δ= O\left(ρ/\sqrt{…

We extend the Eliashberg-Thurston theorem on approximations of taut oriented $C^2$-foliations of 3-manifolds by both positive and negative contact structures to a large class of taut oriented $C^{1,0}$-foliations, where by $C^{1,0}$ foliation, we mean a foliation with continuous tangent plane field. These $C^{1,0}$-fol…

We consider a class of discrete optimization problems that aim to maximize a submodular objective function subject to a distributed partition matroid constraint. More precisely, we consider a networked scenario in which multiple agents choose actions from local strategy sets with the goal of maximizing a submodular obj…

Temporal Point Processes (TPP) with partial likelihoods involving a latent structure often entail an intractable marginalization, thus making inference hard. We propose a novel approach to Maximum Likelihood Estimation (MLE) involving approximate inference over the latent variables by minimizing a tight upper bound on …

Tight triangulated manifolds are generalisations of neighborly triangulations of closed surfaces and are interesting objects in Combinatorial Topology. Tight triangulated manifolds are conjectured to be minimal. Except few, all the known tight triangulated manifolds are stacked. It is known that locally stacked tight t…

In this paper, we consider the problem of estimating the underlying graph associated with an Ising model given a number of independent and identically distributed samples. We adopt an \emph{approximate recovery} criterion that allows for a number of missed edges or incorrectly-included edges, in contrast with the widel…

Tight geodesics were introduced by Masur-Minsky in [17]. They and their hierarchies have been a powerful tool in the study of the curve complex, mapping class groups, Teichmüller spaces, and hyperbolic 3-manifolds. In the same paper, they showed that there are at least one and at most finitely many tight geodesics betw…

We introduce the notion of tight homomorphism into a locally compact group with nonvanishing bounded cohomology and study these homomorphisms in detail when the target is a Lie group of Hermitian type. Tight homomorphisms between Lie groups of Hermitian type give rise to tight totally geodesic maps of Hermitian symmetr…

The paper provides bounds for LSA with fixed stepsizes under random estimates.

We develop coresets for multiple ℓ_p regression problems, improving approximation sizes and efficiency.

The study identifies conditions for algorithms to have tight generalization bounds.

We consider variants of trust-region and cubic regularization methods for non-convex optimization, in which the Hessian matrix is approximated. Under mild conditions on the inexact Hessian, and using approximate solution of the corresponding sub-problems, we provide iteration complexity to achieve $ε$-approximate seco…

The paper tightens bounds on covering numbers for deep ReLU networks.

Surgery on knots always admits a tight contact structure.

Tight maps was introduced along tight homomorphisms by Burger, Iozzi and Wienhard with aims towards maximal representations. In this paper we classify tight maps into classical Hermitian symmetric spaces and give a partial result for the exceptional spaces.

3-manifold triangulations are Golod and tight, proven through a topological characterization.

Simply connected spaces of tight frames identified.

The study finds many tight contact structures on hyperbolic 3-spheres.

State-of-the-art methods in convex and non-convex optimization employ higher-order derivative information, either implicitly or explicitly. We explore the limitations of higher-order optimization and prove that even for convex optimization, a polynomial dependence on the approximation guarantee and higher-order smoothn…

Study tight contact structures on specific 3-manifolds.

Classifies tight contact structures on surgeries of the Whitehead link.

We study the sample complexity of learning one-hidden-layer convolutional neural networks (CNNs) with non-overlapping filters. We propose a novel algorithm called approximate gradient descent for training CNNs, and show that, with high probability, the proposed algorithm with random initialization grants a linear conve…

We show that any co-orientable foliation of dimension two on a closed orientable $3$-manifold with continuous tangent plane field can be $C^0$-approximated by both positive and negative contact structures unless all the leaves are simply connected. As applications we deduce that the existence of a taut $C^0$-foliation …

In this paper we develop a method for studying tight contact structures on lens spaces. We then derive uniqueness and non-existence statements for tight contact structures with certain (half) Euler classes on lens spaces. We also prove that any lens space admits only finitely many tight contact structures.

In \cite{confol} Y. Eliashberg and W. Thurston gave a definition of tight confoliations. We give an example of a tight confoliation $ξ$ on $T^3$ violating the Thurston-Bennequin inequalities. This answers a question from \cite{confol} negatively. Although the tightness of a confoliation does not imply the Thurston-Benn…

New method improves performance of Hamiltonian MCMC for log Z estimation.

We describe notions of tautness that arise in the study of $C^0$ foliations, $C^{1,0}$ or smoother foliations, and in geometry. We give examples to show that these notions are different, and discuss how these differences impact some classical foliation results. We construct examples of smoothly taut $C^{\infty,0}$ foli…

Classifies real tight contact structures on lens spaces and solid tori.

The study finds algebraically overtwisted tight 3-manifolds via contact surgeries.

New proof of Giroux Correspondence for tight contact 3-manifolds.

Scalable method bounds Lipschitz constant of generative models.

Suppose that $\mathcal F$ is a transversely oriented, codimension one foliation of a connected, closed, oriented 3-manifold. Suppose also that $\mathcal F$ has continuous tangent plane field and is {\sl taut}; that is, closed smooth transversals to $\mathcal F$ pass through every point of $M$. We show that if $\mathcal…

We give a short proof that if a non-trivial band sum of two knots results in a tight fibered knot, then the band sum is a connected sum. In particular, this means that any prime knot obtained by a non-trivial band sum is not tight fibered. Since a positive L-space knot is tight fibered, a non-trivial band sum never yie…