arXiv research

The study proves curvature bounds for hyperkähler manifolds.

Proves and tests methods for learning time-series with breaks.

New deep learning method simplifies parameter estimation design.

We prove some recent experimental observations of D. Reznik concerning periodic billiard orbits in ellipses. For example, the sum of cosines of the angles of a periodic billiard polygon remains constant in the one-parameter family of such polygons (that exist due to the Poncelet porism). In our proofs, we use geometric…

New proof confirms rolling objects can follow any path.

Medical imaging systems are commonly assessed by use of objective image quality measures. Supervised deep learning methods have been investigated to implement numerical observers for task-based image quality assessment. However, labeling large amounts of experimental data to train deep neural networks is tedious, expen…

Lean Copilot uses LLMs to assist theorem proving in Lean, improving efficiency and automation.

Paper proves mathematically that poisoning datasets can be detected.

Enhances random forest consistency and introduces DMRF for improved performance.

New method shows unfair explanations can be created for any classifier.

We improve random forest consistency and performance with DMRF, a new variant.

We propose a new randomized ensemble technique with a provable security guarantee against black-box transfer attacks. Our proof constructs a new security problem for random binary classifiers which is easier to empirically verify and a reduction from the security of this new model to the security of the ensemble classi…

We prove a volume inequality for 3-manifolds having C^0 metrics "bent" along a hypersurface, and satisfying certain curvature pinching conditions. The result makes use of Perelman's work on Ricci flow and geometrization of closed 3-manifolds. Corollaries include a new proof of a conjecture of Bonahon about volumes of c…

In this brief we investigate the generalization properties of a recently-proposed class of non-parametric activation functions, the kernel activation functions (KAFs). KAFs introduce additional parameters in the learning process in order to adapt nonlinearities individually on a per-neuron basis, exploiting a cheap ker…

We consider the existence of simple closed geodesics or "geodesic knots" in finite volume orientable hyperbolic 3-manifolds. Previous results show that at least one geodesic knot always exists [Bull. London Math. Soc. 31(1) (1999) 81-86], and that certain arithmetic manifolds contain infinitely many geodesic knots [J. …

Paper proves MS convergence for radially symmetric kernels with large bandwidths.

We consider stochastic gradient descent algorithms for minimizing a non-smooth, strongly-convex function. Several forms of this algorithm, including suffix averaging, are known to achieve the optimal $O(1/T)$ convergence rate in expectation. We consider a simple, non-uniform averaging strategy of Lacoste-Julien et al. …

We establish the first nonasymptotic error bounds for Kaplan-Meier-based nearest neighbor and kernel survival probability estimators where feature vectors reside in metric spaces. Our bounds imply rates of strong consistency for these nonparametric estimators and, up to a log factor, match an existing lower bound for c…

We revisit the classical decision-theoretic problem of weighted expert voting from a statistical learning perspective. In particular, we examine the consistency (both asymptotic and finitary) of the optimal Nitzan-Paroush weighted majority and related rules. In the case of known expert competence levels, we give sharp …

The Turaev-Viro invariants are a powerful family of topological invariants for distinguishing between different 3-manifolds. They are invaluable for mathematical software, but current algorithms to compute them require exponential time. The invariants are parameterised by an integer $r \geq 3$. We resolve the question …

LeanDojo removes barriers to theorem proving with open-source tools and data.

Stochastic zeroth-order (SZO), or gradient-free, optimization allows to optimize arbitrary functions by relying only on function evaluations under parameter perturbations, however, the iteration complexity of SZO methods suffers a factor proportional to the dimensionality of the perturbed function. We show that in scen…

Devoted to multi-task learning and structured output learning, operator-valued kernels provide a flexible tool to build vector-valued functions in the context of Reproducing Kernel Hilbert Spaces. To scale up these methods, we extend the celebrated Random Fourier Feature methodology to get an approximation of operator-…

Online Normalization is a new technique for normalizing the hidden activations of a neural network. Like Batch Normalization, it normalizes the sample dimension. While Online Normalization does not use batches, it is as accurate as Batch Normalization. We resolve a theoretical limitation of Batch Normalization by intro…

FineMorphs models smooth transformations for multivariate regression.

Mechanisms for fair resource allocation learn user preferences online.

Machine learning algorithms typically rely on optimization subroutines and are well-known to provide very effective outcomes for many types of problems. Here, we flip the reliance and ask the reverse question: can machine learning algorithms lead to more effective outcomes for optimization problems? Our goal is to trai…

Lasso proves consistent model selection for high-dimensional Ising models.

In this paper, we provide two new stable online algorithms for the problem of prediction in reinforcement learning, \emph{i.e.}, estimating the value function of a model-free Markov reward process using the linear function approximation architecture and with memory and computation costs scaling quadratically in the siz…

Researchers found PP-GANs can hide sensitive data in sanitized images, undermining privacy checks.

The paper improves dropout's utility by reducing interactions in deep neural networks.

We consider smooth isotropic immersions from the 2-dimensional torus into $R^{2n}$, for $n \geq 2$. When $n = 2$ the image of such map is an immersed Lagrangian torus of $R^4$. We prove that such isotropic immersions can be approximated by arbitrarily $C^0$-close piecewise linear isotropic maps. If $n \geq 3$ the piece…

Scientific practice typically involves repeatedly studying a system, each time trying to unravel a different perspective. In each study, the scientist may take measurements under different experimental conditions (interventions, manipulations, perturbations) and measure different sets of quantities (variables). The res…

The abstract proves the existence of universal lottery tickets without needing further training.

Vector-valued neural learning has emerged as a promising direction in deep learning recently. Traditionally, training data for neural networks (NNs) are formulated as a vector of scalars; however, its performance may not be optimal since associations among adjacent scalars are not modeled. In this paper, we propose a n…

Convolutional neural networks (CNNs) are commonly used for image classification tasks, raising the challenge of their application on data flows. During their training, adaptation is often performed by tuning the learning rate. Usual learning rate strategies are time-based i.e. monotonously decreasing. In this paper, we…

Graph Weighted Models (GWMs) have recently been proposed as a natural generalization of weighted automata over strings and trees to arbitrary families of labeled graphs (and hypergraphs). A GWM generically associates a labeled graph with a tensor network and computes a value by successive contractions directed by its e…

New algorithm profiles nuisance parameters for multidimensional deconvolution.

We consider the problem of recovering a common latent source with independent components from multiple views. This applies to settings in which a variable is measured with multiple experimental modalities, and where the goal is to synthesize the disparate measurements into a single unified representation. We consider t…

In this paper, we investigate algorithms for anomaly detection. Previous anomaly detection methods focus on modeling the distribution of non-anomalous data provided during training. However, this does not necessarily ensure the correct detection of anomalous data. We propose a new Regularized Cycle Consistent Generativ…

Bayesian design improves experimental optimization.

We extend the concept of transfer learning, widely applied in modern machine learning algorithms, to the emerging context of hybrid neural networks composed of classical and quantum elements. We propose different implementations of hybrid transfer learning, but we focus mainly on the paradigm in which a pre-trained cla…

GeneDisco benchmarks experimental design for drug discovery.

This paper presents a proof-of-concept demonstration of triaxial strain tomography from Bragg-edge neutron imaging within a three-dimensional sample. Bragg-edge neutron transmission can provide high-resolution images of the average through thickness strain within a polycrystalline material. This poses an associated ric…

We study random knotting by considering knot and link diagrams as decorated, (rooted) topological maps on spheres and pulling them uniformly from among sets of a given number of vertices $n$, as first established in recent work with Cantarella and Mastin. The knot diagram model is an exciting new model which captures b…

In this paper, we propose to (seamlessly) integrate b-bit minwise hashing with linear SVM to substantially improve the training (and testing) efficiency using much smaller memory, with essentially no loss of accuracy. Theoretically, we prove that the resemblance matrix, the minwise hashing matrix, and the b-bit minwise…

Several first order stochastic optimization methods commonly used in the Euclidean domain such as stochastic gradient descent (SGD), accelerated gradient descent or variance reduced methods have already been adapted to certain Riemannian settings. However, some of the most popular of these optimization tools - namely A…

Several proofs of Fáry--Milnor theorem are presented.