arXiv research

The study confirms conjectures about normals to convex polytopes in 3D space.

We study the equilibrium positions of three points on a convex curve under influence of the Coulomb potential. We identify these positions as orthotripods, three points on the curve having concurrent normals. This relates the equilibrium positions to the caustic (evolute) of the curve. The concurrent normals can only m…

The paper discusses the impossibility of eliminating surplus intersections in Lagrangian submanifolds.

Capsule networks improve performance on image classification tasks with fewer parameters.

A new proof shows almost every normal to a smooth convex body intersects at least 6 normals from different points.

This paper examines a generalized Kropina metric and its geometric properties.

The paper studies Finsler spaces with semi-concurrent vector fields and their equivalence to Riemannian spaces.

A Ricci soliton $(M^n,g,v,λ)$ on a Riemannian manifold $(M^n,g)$ is said to have concurrent potential field if its potential field $v$ is a concurrent vector field. In the first part of this paper we completely classify Ricci solitons with concurrent potential fields. In the second part we derive a necessary and suffic…

The paper proves a conjecture about normals of immersed manifolds.

A Ricci soliton $(M,g,v,λ)$ on a Riemannian manifold $(M,g)$ is said to have concurrent potential field if its potential field $v$ is a concurrent vector field. Ricci solitons arisen from concurrent vector fields on Riemannian manifolds were studied recently in \cite{CD2}. The most important concurrent vector field is …

In the present paper, we introduce and investigate the notion of a semi concurrent vector field on a Finsler manifold. We show that some special Finsler manifolds admitting such vector fields turn out to be Riemannian. We prove that Tachibana's characterization of Finsler manifolds admitting a concurrent vector field l…

The paper studies the number of normals to ellipsoids and their intersections with caustics.

Speeds up deep neural networks training by 10x using GPU concurrency.

Classifies surfaces with great and small circles through each point.

A new reinforcement learning method for robots thinking and moving simultaneously.

BCO* improves BCO by concurrently training inverse dynamics and expert policy.

The present paper deals with an \emph{intrinsic} investigation of the notion of a concurrent $π$-vector field on the pullback bundle of a Finsler manifold $(M,L)$. The effect of the existence of a concurrent $π$-vector field on some important special Finsler spaces is studied. An intrinsic investigation of a particular…

We consider the problem of concurrent portfolio losses in two non-overlapping credit portfolios. In order to explore the full statistical dependence structure of such portfolio losses, we estimate their empirical pairwise copulas. Instead of a Gaussian dependence, we typically find a strong asymmetry in the copulas. Co…

New algorithm provably converges to second-order stationary points in NMF.

Paper proposes a method to learn and exceed expert demonstrations in unknown reward environments.

Novel framework for data sharing and coordinated exploration in concurrent RL with non-identical environments.

In this paper, we completely classify almost Yamabe solitons on hypersurfaces in Euclidean spaces arisen from the position vector field. Some results of almost Yamabe solitons with a concurrent vector field and almost Yamabe solitons on submanifolds in Riemannian manifolds equipped with a concurrent vector field are al…

Study caustics of an elliptical paraboloid and extend Apollonius problem solution.

We generalize Matsumoto metrics with a special π-form and explore their geometric properties.

Deep learning model classifies concurrent human interactions from WiFi data with high accuracy.

MMM model clusters mixed-type longitudinal data efficiently.

Training neural network often uses a machine learning framework such as TensorFlow and Caffe2. These frameworks employ a dataflow model where the NN training is modeled as a directed graph composed of a set of nodes. Operations in neural network training are typically implemented by the frameworks as primitives and rep…

New algorithm trains neural nets on simple skills to learn complex tasks faster.

A novel method optimizes variable-stiffness structures for better strength and weight.

We consider a team of reinforcement learning agents that concurrently operate in a common environment, and we develop an approach to efficient coordinated exploration that is suitable for problems of practical scale. Our approach builds on seed sampling (Dimakopoulou and Van Roy, 2018) and randomized value function lea…

Study on vector fields on Lie groups reveals surprising algebraic coincidences.

The aim of this paper is to train an RBF neural network and select centers under concurrent faults. It is well known that fault tolerance is a very attractive property for neural networks. And center selection is an important procedure during the training process of an RBF neural network. In this paper, we devise two n…

In dialogues, an utterance is a chain of consecutive sentences produced by one speaker which ranges from a short sentence to a thousand-word post. When studying dialogues at the utterance level, it is not uncommon that an utterance would serve multiple functions. For instance, "Thank you. It works great." expresses bot…

The presence of data corruption in user-generated streaming data, such as social media, motivates a new fundamental problem that learns reliable regression coefficient when features are not accessible entirely at one time. Until now, several important challenges still cannot be handled concurrently: 1) corrupted data e…

Today's Cyber-Physical Systems (CPSs) are large, complex, and affixed with networked sensors and actuators that are targets for cyber-attacks. Conventional detection techniques are unable to deal with the increasingly dynamic and complex nature of the CPSs. On the other hand, the networked sensors and actuators generat…

New algorithms improve tensor CP decomposition under mild conditions.

We introduce economic models based on Boolean Delay Equations: this formalism makes easier to take into account the complexity of the interactions between firms and is particularly appropriate for studying the propagation of an initial damage due to a catastrophe. Here we concentrate on simple cases, which allow to und…

Study of almost Yamabe solitons on Kaehler submersions.

WAEs offer a statistical understanding of density estimation and error bounds.

For large-scale industrial processes under closed-loop control, process dynamics directly resulting from control action are typical characteristics and may show different behaviors between real faults and normal changes of operating conditions. However, conventional distributed monitoring approaches do not consider the…

The stability of the financial system is associated with systemic risk factors such as the concurrent default of numerous small obligors. Hence it is of utmost importance to study the mutual dependence of losses for different creditors in the case of large, overlapping credit portfolios. We analytically calculate the m…

Stochastic Gradient Descent (SGD) is a fundamental algorithm in machine learning, representing the optimization backbone for training several classic models, from regression to neural networks. Given the recent practical focus on distributed machine learning, significant work has been dedicated to the convergence prope…

A TS algorithm improves performance in multi-task bandits with transfer.

Deep reinforcement learning algorithms have recently been used to train multiple interacting agents in a centralised manner whilst keeping their execution decentralised. When the agents can only acquire partial observations and are faced with tasks requiring coordination and synchronisation skills, inter-agent communic…

The book contents: the notion of Myller configurations, Darboux frame, fundamental formulae and fundamental theorem of existence. The complete system of invariants allows to introduce the notions of Myller parallelism and concurrence as well as a famous Klein's formula. By way it is obtained an important generalization…

The splitting number is effective to distinguish the embedded topology of plane curves, and it is not determined by the fundamental group of the complement of the plane curve. In this paper, we give a generalization of the splitting number, called the splitting graph. By using the splitting graph, we classify the embed…

A method for identifying NPWARX models with arbitrary domains using probabilistic mixture models.

This research tackles image classification with noise, proposing committees of CNNs.