arXiv research

ALP outperforms other data descriptors in one-class classification.

Optimizes one-class classification methods for better performance.

The problem of spoofing attacks is increasingly relevant as digital systems are becoming more ubiquitous. Thus the detection of such attacks and the localisation of attackers have been objects of recent study. After an attack has been detected, various algorithms have been proposed in order to localise the attacker. In…

Equivalent bicategories constructed from action Lie groupoids.

The paper applies $S^1$-localization to symplectic cohomology.

Iterative procedures for parameter estimation based on stochastic gradient descent allow the estimation to scale to massive data sets. However, in both theory and practice, they suffer from numerical instability. Moreover, they are statistically inefficient as estimators of the true parameter value. To address these tw…

Convolutional neural network localizes OD and fovea in UWFoV-SLO images.

Optimal scaling for proximal MALA in high dimensions confirmed.

This paper studies the lower bound complexity for the optimization problem whose objective function is the average of $n$ individual smooth convex functions. We consider the algorithm which gets access to gradient and proximal oracle for each individual component. For the strongly-convex case, we prove such an algorith…

Solves open problem on Lie groupoids equivalence.

DE-PSGLD samples from constrained distributions in a decentralized manner.

We consider the problem of minimizing the sum of two convex functions: one is the average of a large number of smooth component functions, and the other is a general convex function that admits a simple proximal mapping. We assume the whole objective function is strongly convex. Such problems often arise in machine lea…

In this paper, we discuss the problem of minimizing the sum of two convex functions: a smooth function plus a non-smooth function. Further, the smooth part can be expressed by the average of a large number of smooth component functions, and the non-smooth part is equipped with a simple proximal mapping. We propose a pr…

We solve 6-DoF localisation and 3D reconstruction using deep state-space models.

We investigate whether ResNet architectures can outperform more traditional Convolutional Neural Networks on the task of fine-grained vehicle classification. We train and test ResNet-18, ResNet-34 and ResNet-50 on the Comprehensive Cars dataset without pre-training on other datasets. We then modify the networks to use …

Develops a new theory of localization in algebraic geometry.

Paper establishes lower bounds for finite-sum optimization problems using novel construction methods.

CNNs help diagnose diabetic retinopathy by localizing lesions.

We propose a method that performs anomaly detection and localisation within heterogeneous data using a pairwise undirected mixed graphical model. The data are a mixture of categorical and quantitative variables, and the model is learned over a dataset that is supposed not to contain any anomaly. We then use the model o…

Formula for fixed points on noncompact spaces.

Efficient solver for nonconvex tensor regularization reduces computational cost.

The OSCAR (octagonal selection and clustering algorithm for regression) regularizer consists of a L_1 norm plus a pair-wise L_inf norm (responsible for its grouping behavior) and was proposed to encourage group sparsity in scenarios where the groups are a priori unknown. The OSCAR regularizer has a non-trivial proximit…

New approach to $Z$-stability and critical metrics on Kähler manifolds.

Analytic torsion defined for non-compact Lie groups and discrete subgroups.

The equivariant coarse index is well-understood and widely used for actions by discrete groups. We extend the definition of this index to general locally compact groups. We use a suitable notion of admissible modules over $C^*$-algebras of continuous functions to obtain a meaningful index. Inspired by work by Roe, we t…

We propose a new stochastic first-order algorithmic framework to solve stochastic composite nonconvex optimization problems that covers both finite-sum and expectation settings. Our algorithms rely on the SARAH estimator introduced in (Nguyen et al, 2017) and consist of two steps: a proximal gradient and an averaging s…

Paper improves a method for fast global and local convergence in optimization.

We present a distributed proximal-gradient method for optimizing the average of convex functions, each of which is the private local objective of an agent in a network with time-varying topology. The local objectives have distinct differentiable components, but they share a common nondifferentiable component, which has…

The success of deep learning has led to a rising interest in the generalization property of the stochastic gradient descent (SGD) method, and stability is one popular approach to study it. Existing works based on stability have studied nonconvex loss functions, but only considered the generalization error of the SGD in…

Quantile regression using random forest proximities improves prediction and uncertainty quantification.

Asynchronous parallel optimization algorithms for solving large-scale machine learning problems have drawn significant attention from academia to industry recently. This paper proposes a novel algorithm, decoupled asynchronous proximal stochastic gradient descent (DAP-SGD), to minimize an objective function that is the…

We propose a new stochastic coordinate descent method for minimizing the sum of convex functions each of which depends on a small number of coordinates only. Our method (APPROX) is simultaneously Accelerated, Parallel and PROXimal; this is the first time such a method is proposed. In the special case when the number of…

New ensemble methods improve time series forecasting accuracy.

As sensor networks for health monitoring become more prevalent, so will the need to control their usage and consumption of energy. This paper presents a method which leverages the algorithm's performance and energy consumption. By utilising Reinforcement Learning (RL) techniques, we provide an adaptive framework, which…

Extends robust methods for causal inference, improving estimator performance.

Meta-models predict model hyperparameters for NDT experiments.

We consider saddle point problems which objective functions are the average of $n$ strongly convex-concave individual components. Recently, researchers exploit variance reduction methods to solve such problems and achieve linear-convergence guarantees. However, these methods have a slow convergence when the condition n…

This paper explores estimating chaotic dynamics and parameters using local ensemble Kalman filters.

Study $SL(2,\mathbb{C})$ connections on Seifert-fibered spaces using gauge theory.

Random Forest proximity measures for multi-view classification.

We present homotopy theoretic and geometric interpretations of the Kane-Mele invariant for gapped fermionic quantum systems in three dimensions with time-reversal symmetry. We show that the invariant is related to a certain 4-equivalence which lends it an interpretation as an obstruction to a block decomposition of the…

We consider a wide range of regularized stochastic minimization problems with two regularization terms, one of which is composed with a linear function. This optimization model abstracts a number of important applications in artificial intelligence and machine learning, such as fused Lasso, fused logistic regression, a…

While facial biometrics has been widely used for identification purpose, it has recently been researched as medical biometrics for a range of diseases. In this chapter, we investigate the facial landmark detection for atypical 3D facial modelling in facial palsy cases, while potentially such modelling can assist the me…

Improved shuffling gradient methods converge faster for nonsmooth convex optimization.

This article is a first step in establishing a link between the Donaldson polynomials and Seiberg-Witten invariants of a smooth 4-manifold.

We present a simple one-parameter model for spatially localised evolving agents competing for spatially localised resources. The model considers selling agents able to evolve their pricing strategy in competition for a fixed market. Despite its simplicity, the model displays extraordinarily rich behavior. In addition t…

Due to the recent advancements in wearables and sensing technology, health scientists are increasingly developing mobile health (mHealth) interventions. In mHealth interventions, mobile devices are used to deliver treatment to individuals as they go about their daily lives. These treatments are generally designed to im…

In this paper we present an optimization-based view of distributed parameter estimation and observational social learning in networks. Agents receive a sequence of random, independent and identically distributed (i.i.d.) signals, each of which individually may not be informative about the underlying true state, but the…