A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Deep neural network predicts finger counting and numerosity estimation.
While invasively recorded brain activity is known to provide detailed information on motor commands, it is an open question at what level of detail information about positions of body parts can be decoded from non-invasively acquired signals. In this work it is shown that index finger positions can be differentiated fr…
The von Neumann graph entropy (VNGE) facilitates measurement of information divergence and distance between graphs in a graph sequence. It has been successfully applied to various learning tasks driven by network-based data. While effective, VNGE is computationally demanding as it requires the full eigenspectrum of the…
Study knot diagrams on a sphere without vertical lines, focusing on minimal crossings.
Developed Taylor series for muscle-finger system analysis.
We report analytical results for the development of the viscous fingering instability in a cylindrical Hele-Shaw cell of radius a and thickness b. We derive a generalized version of Darcy's law in such cylindrical background, and find it recovers the usual Darcy's law for flow in flat, rectangular cells, with correctio…
We use reinforcement learning (RL) to learn dexterous in-hand manipulation policies which can perform vision-based object reorientation on a physical Shadow Dexterous Hand. The training is performed in a simulated environment in which we randomize many of the physical properties of the system like friction coefficients…
For humans, the process of grasping an object relies heavily on rich tactile feedback. Most recent robotic grasping work, however, has been based only on visual input, and thus cannot easily benefit from feedback after initiating contact. In this paper, we investigate how a robot can learn to use tactile information to…
A successful grasp requires careful balancing of the contact forces. Deducing whether a particular grasp will be successful from indirect measurements, such as vision, is therefore quite challenging, and direct sensing of contacts through touch sensing provides an appealing avenue toward more successful and consistent …
DIGIT is a low-cost tactile sensor for in-hand manipulation.
Method estimates fingertip forces, torques, and curvatures from fingernail images.
Deep learning is an established framework for learning hierarchical data representations. While compute power is in abundance, one of the main challenges in applying this framework to robotic grasping has been obtaining the amount of data needed to learn these representations, and structuring the data to the task at ha…
Designing of touchless user interface is gaining popularity in various contexts. Using such interfaces, users can interact with electronic devices even when the hands are dirty or non-conductive. Also, user with partial physical disability can interact with electronic devices using such systems. Research in this direct…
Grasping is a complex process involving knowledge of the object, the surroundings, and of oneself. While humans are able to integrate and process all of the sensory information required for performing this task, equipping machines with this capability is an extremely challenging endeavor. In this paper, we investigate …
We analyze the effect of adding, removing, and moving basepoints on link Floer homology. We prove that adding or removing basepoints via a procedure called quasi-stabilization is a natural operation on a certain version of link Floer homology, which we call . We consider the effect on the full link Flo…
Construction of (colored) knot polynomials for double-fat graphs is further generalized to the case when "fingers" and "propagators" are substituting R-matrices in arbitrary closed braids with m-strands. Original version of arXiv:1504.00371 corresponds to the case m=2, and our generalizations sheds additional light on …
Counting tripods on a flat torus using lattice point counting.
Flow Matching for count data improves sample quality and efficiency.
Link concordance equals homotopy for high-dimensional spheres.
This paper starts a systematic description of colored knot polynomials, beginning from the first non-(anti)symmetric representation R=[2,1]. The project involves several steps: (i) parametrization of big families of knots a la arXiv:1506.00339, (ii) evaluating Racah/mixing matrices for various numbers of strands in var…
New theorem counts curves on orbifolds.
A new method, Count-MORL, improves offline reinforcement learning by using state-action frequency.
Proposes a method to reconcile count time series forecasts.
Study geodesic paths on flat surfaces, comparing length and singularity counts.
Graph neural networks struggle with counting certain substructures in graphs.
Deviance-style normalization for sparse, jointly overdispersed count matrices
Counts arcs in surfaces, proving convergence of geodesic currents.
The paper proposes count echo state networks for forecasting graduate student enrollments.
Counted essential surfaces in a knot's exterior, finding a unique pattern.
The abstract reviews models for analyzing count data.
Counting objects in digital images is a process that should be replaced by machines. This tedious task is time consuming and prone to errors due to fatigue of human annotators. The goal is to have a system that takes as input an image and returns a count of the objects inside and justification for the prediction in the…
Positive definite operator-valued kernels generalize the well-known notion of reproducing kernels, and are naturally adapted to multi-output learning situations. This paper addresses the problem of learning a finite linear combination of infinite-dimensional operator-valued kernels which are suitable for extending func…
Paper proposes a method to estimate uncertainty in counting tasks in medical imaging.
Proposes a robust EM algorithm for analyzing incomplete panel count data.
Functional Magnetic Resonance Imaging (fMRI) relies on multi-step data processing pipelines to accurately determine brain activity; among them, the crucial step of spatial smoothing. These pipelines are commonly suboptimal, given the local optimisation strategy they use, treating each step in isolation. With the advent…
Let X be a finite 2-complex with unfree fundamental group. We prove lower bounds for the area of a metric on X, in terms of the square of the least length of a noncontractible loop in X. We thus establish a uniform systolic inequality for all unfree 2-complexes. Our inequality improves the constant in M. Gromov's inequ…
Calegari, Marques, and Neves count minimal surfaces in hyperbolic manifolds.
Quantum theory improves counting overlapping clusters.
Better neural arithmetic logic units improve cell counting model generalization.
Counts minimal tori in Riemannian manifolds with 6 or more dimensions.
In recent scene recognition research images or large image regions are often represented as disorganized "bags" of features which can then be analyzed using models originally developed to capture co-variation of word counts in text. However, image feature counts are likely to be constrained in different ways than word …
Estimates point counts in Teichmüller space for mapping class groups.
Study counts and equidistributes rational points in quaternionic Heisenberg groups.
Proves quaternionic analog of Cartan's theorem and counts arithmetic chains.
Study shows how to count and equidistribute cusped Hitchin representations with entropy gaps.
Enhances psyquandle counting invariants using cocycles.
We prove formulae for the countings by orbit of square-tiled surfaces of genus two with one singularity. These formulae were conjectured by Hubert & Lelièvre. We show that these countings admit quasimodular forms as generating functions.
Graphlets are defined as k-node connected induced subgraph patterns. For an undirected graph, 3-node graphlets include close triangle and open triangle. When k = 4, there are six types of graphlets, e.g., tailed-triangle and clique are two possible 4-node graphlets. The number of each graphlet, called graphlet count, i…