Method tracks finger movements to render shapes on display devices.
problem Designing touchless user interfaces for electronic devices.
method Leap Motion controller tracks finger movements, analyzes trajectories, and uses HMM for gesture recognition.
result Method achieves 92.87% accuracy in rendering shapes on display devices.
In this report, an automated bartender system was developed for making orders in a bar using hand gestures. The gesture recognition of the system was developed using Machine Learning techniques, where the model was trained to classify gestures using collected data. The final model used in the system reached an average …
SGD learns neural networks with a complexity measure called leap.
problem Time complexity of SGD learning on neural networks.
method Introduced a complexity measure called leap, proved conjecture for Gaussian data, and showed saddle-to-saddle dynamics.
result Proved a conjecture about the time complexity of learning functions with low-dimensional support.
LEAP predicts graph edges and weights from path aggregations.
problem Predicting edges and weights in graphs.
method Trainable framework based on path aggregations.
result LEAP outperforms state-of-the-art methods in link and rating prediction.
LEAPS samples discrete distributions via CTMCs and locally equivariant networks.
problem Sampling from discrete distributions with known normalization.
method Continuous-time Markov chain, locally equivariant functions, attention layers, convolutional networks.
result LEAPS minimizes the variance of importance weights, improving sampling efficiency.
LEAP nets model power grid disruptions for rapid response.
problem Modeling and predicting power grid disruptions.
method Transfer learning neural network embedding approach.
result LEAP nets can rapidly assess human operators' actions in emergencies.
Two-layer networks learn faster with batch reuse, overcoming information and leap exponents.
problem Limitations of gradient flow and single-pass GD in learning multi-index target functions.
method Multi-pass gradient descent that reuses batches, analyzed using Dynamical Mean-Field Theory.
result Two-time-step overlap with target subspace for non-staircase functions, overcoming information and leap exponents.
Leap framework transfers knowledge across learning processes for improved performance.
problem Transfer learning struggles with new tasks not linked to previous tasks.
method Leap framework associates each task with a manifold and minimizes the expected path length during training.
result Leap outperforms competing methods in meta-learning and transfer learning.
LEAPS uses semantic models to improve reinforcement learning in diverse environments.
problem Generalizing and adapting to unseen environments in reinforcement learning.
method Hybrid model-based and model-free approach with a multi-target sub-policy and a Bayesian semantic model.
result LEAPS outperforms baselines in visual navigation tasks using diverse indoor scenes.
The paper analyzes sampling efficiency of discrete diffusion models, providing sharp and adaptive guarantees.
problem Theoretical foundations of discrete diffusion models, especially sampling efficiency.
method Continuous-time Markov chain (CTMC) formulation, τ τ τ -leaping-based samplers, effective total correlation. result The τ τ τ -leaping algorithm achieves an iteration complexity of order i l d e O ( d / ε ) ilde O(d/\varepsilon) i l d e O ( d / ε ) for uniform discrete diffusion, improving existing bounds by a factor of d d d . Study efficient estimation of hidden subspaces in Gaussian Multi-index models.
problem Estimating hidden subspaces in Gaussian Multi-index models with low-dimensional projections.
method Introduced the generative leap exponent and developed an agnostic sequential estimation procedure using spectral U-statistics.
result Achieved optimal sample complexity of $n=Θ(d^{1 \vee \k/2})$ for efficient estimation.
Corrected samplers reduce discretization error in discrete flow models without additional computational cost.
problem Discretization error in samplers for discrete flow models.
method Established non-asymptotic error bounds for samplers, proposed time-corrected and location-corrected samplers.
result Location-corrected sampler has lower complexity and better generation quality.
LEAP identifies latent causal variables from temporal data.
problem Recovering time-delayed latent causal variables from general temporal data.
method Proposes LEAP, a framework that extends VAEs with constraints for temporally causal latent processes.
result Successfully identifies temporally causal latent processes from observed variables under various dependency structures.
This work analyzes discrete diffusion models using stochastic integrals, providing error bounds and insights.
problem Error analysis for discrete diffusion models remains less understood.
method Proposes a comprehensive framework based on Lévy-type stochastic integrals.
result Obtains the first error bound for the τ τ τ -leaping scheme in KL divergence. Feature selection and attribute reduction are crucial problems, and widely used techniques in the field of machine learning, data mining and pattern recognition to overcome the well-known phenomenon of the Curse of Dimensionality, by either selecting a subset of features or removing unrelated ones. This paper presents …
New method improves inference for discrete diffusion models, achieving better quality and efficiency.
problem High dimensionality of discrete diffusion models causes inference challenges.
method Developed high-order numerical inference schemes for discrete diffusion models.
result Second-order accuracy of the θ θ θ -Trapezoidal method in KL divergence. We consider the problem of impulse response estimation of stable linear single-input single-output systems. It is a well-studied problem where flexible non-parametric models recently offered a leap in performance compared to the classical finite-dimensional model structures. Inspired by this development and the success…
Survey on discovering causal relationships from data.
problem Discover causal relationships from data.
method Modern, continuous optimization methods for structure learning.
result Survey of methods and resources for structure discovery.
Medical applications challenge today's text categorization techniques by demanding both high accuracy and ease-of-interpretation. Although deep learning has provided a leap ahead in accuracy, this leap comes at the sacrifice of interpretability. To address this accuracy-interpretability challenge, we here introduce, fo…
Reweighted ALPS improves sampling from multimodal distributions using warm start points.
problem Sampling from multimodal distributions is hard due to exponential mixing times.
method Introduces Reweighted ALPS, a modified Annealed Leap-Point Sampler that uses warm start points.
result First polynomial-time bound for Re-ALPS in a general setting, under a natural assumption.
Kernel methods can learn hierarchical polynomials efficiently.
problem Learning hierarchical structure from data.
method Iteratively reweighting kernel machines using derivatives.
result Efficient learning of hierarchical polynomials.
Long-term human motion can be represented as a series of motion modes---motion sequences that capture short-term temporal dynamics---with transitions between them. We leverage this structure and present a novel Motion Transformation Variational Auto-Encoders (MT-VAE) for learning motion sequence generation. Our model j…
Introduces Motion Programs for better video analysis of human motion.
problem Current video analysis focuses on raw pixels or keypoints, missing higher-level motion primitives.
method Introduces Motion Programs as a neuro-symbolic representation of motions as a composition of high-level primitives.
result Motion Programs accurately describe diverse human motions and improve downstream tasks.
Study shows how price protection affects online learning algorithms for dynamic pricing.
problem Impact of price protection guarantee on online learning algorithms for dynamic pricing.
method Characterized the effect of price protection period length on optimal regret, proposed LEAP algorithm.
result Optimal regret is Θ(√T + min{M, T^2/3}) with LEAP matching lower bounds up to logarithmic factors.
One of the defining characteristics of human creativity is the ability to make conceptual leaps, creating something surprising from typical knowledge. In comparison, deep neural networks often struggle to handle cases outside of their training data, which is especially problematic for problems with limited training dat…
Survey on quantum computing and neural networks.
problem Understanding and comparing quantum computing and neural networks.
method Introduction to quantum computing concepts, explanation of quantum computing paradigms, and analysis of quantum neural networks.
result Current state-of-the-art in quantum neural networks.
Study motion planning for points avoiding obstacles in a plane.
problem Avoiding collisions for multiple points in a plane with unknown obstacles.
method Algebraic and topological tools for motion planning.
result New topological complexity for planar motion planning.
Paper introduces new motion synthesis model using normalizing flows.
problem Data-driven motion synthesis with probabilistic and controllable models.
method Probabilistic, generative, autoregressive model using normalizing flows and LSTMs.
result Randomly sampled motion from the model outperforms task-agnostic baselines.
Programmatic Motion Concepts learn human actions from paired videos.
problem Learning motion concepts from paired video and action sequences.
method Semi-supervised learning architecture for hierarchical motion representation.
result Outperforms established baselines, especially in small data settings.
Unified framework for human motion generation on Riemannian manifolds.
problem Learning valid human motion in Euclidean spaces.
method Riemannian Motion Generation (RMG) on product manifolds, Riemannian flow matching.
result Achieves state-of-the-art FID (0.043) on HumanML3D and surpasses strong baselines on MotionMillion.
Study on determinants of unitary Brownian motion and their asymptotic laws.
problem Understanding determinants of unitary Brownian motion and their behavior over time.
method Using Stiefel fibration and skew-product decomposition of the Stiefel Brownian motion.
result Prove asymptotic laws for determinants of block entries of unitary Brownian motion.
New framework predicts diverse, contextually plausible 3D human motions.
problem Predicting multiple plausible future 3D poses given observed poses.
method Developed a new variational framework that conditions latent variable on past observation to encourage relevant information.
result Our approach generates motions of higher quality and preserves contextual information.
Study refracted skew Brownian motion, find densities and asymptotics.
problem Modeling and analyzing refracted skew Brownian motion.
method Perturbation approach to find potential densities, transition density, and asymptotic behaviors.
result Expressions and asymptotic behaviors of refracted skew Brownian motion.
In this article, a compact finite difference method is proposed for pricing European and American options under jump-diffusion models. Partial integro-differential equation and linear complementary problem governing European and American options respectively are discretized using Crank-Nicolson Leap-Frog scheme. In pro…
Neural network predicts vessel motions with high accuracy.
problem Real-time prediction of heave and surge motions for improved performance and safety.
method Developed an LSTM-based machine learning model trained on measured waves and motion data.
result The model predicts vessel motions up to 46.5 seconds into the future with an average accuracy of 90%.
Study fractal dimension for motion without crossing a subset.
problem Fractal dimension of a subset X in R^n for motion without crossing.
method Analyzes fractal dimension of subset X in R^n.
result Determines conditions for motion without crossing a subset.
Normalizing flows are shown to be equivalent to Bayesian networks, revealing new insights.
problem Understanding the limitations and capabilities of normalizing flows.
method Revisiting normalizing flows as probabilistic graphical models and analyzing their structure.
result Normalizing flows can be reduced to Bayesian networks, revealing new insights into their structure and capabilities.
Let E E E be a closed set in the Riemann sphere C ^ \widehat{\mathbb{C}} C . We consider a holomorphic motion φ φ φ of E E E over a complex manifold M M M , that is, a holomorphic family of injections on E E E parametrized by M M M . It is known that if M M M is the unit disk Δ Δ Δ in the complex plane, then any holomorphic motion of E E E ove…
Neural network estimates rigid motion in stroke imaging to improve image quality.
problem Rigid patient motion during C-arm CBCT imaging reduces image quality.
method Neural network trained to regress reprojection error based on image information.
result Neural network outperforms entropy-based method in motion estimation.
Study cohomological equation for robotic screw motions on SE(3).
problem Understanding obstruction phenomena in robotic rigid-body motion.
method Combining Fourier analysis and Peter-Weyl theory, reduce to finite-dimensional linear transport systems.
result Explicit screw motion illustrates resonance conditions and finite-dimensional obstructions.
New approach for obstacle avoidance in robotics using learned representations.
problem Challenges in sensor-based motion planning for new and dynamic environments.
method Proposes a new obstacle representation using PointNet architecture trained jointly with policies for obstacle avoidance.
result Significant improvements in accuracy and efficiency compared to state of the art.
The paper presents a method to reduce arm motion complexity for prosthetics and robotics.
problem Reducing the complexity of human arm motions for robotic and prosthetic control.
method Data-driven techniques including DTW, DBA, Ward's distance, batch-DTW, and fPCA.
result Representative motion clusters and averages for different arm DOF levels.
Paper defines multi-dimensional fractional Brownian motion under volatility uncertainty.
problem Volatility uncertainty in fractional Brownian motion.
method Definition and study of multi-dimensional fractional Brownian motion (G-fBm) with Hurst index.
result First results on stochastic calculus for G-fBm with Hurst index > 0.5.
Paper introduces a new method for generating diverse human motion predictions.
problem Stochastic human motion prediction with limited flexibility.
method Stochastically combines root variations with previous pose information in a recurrent network.
result Model generates more diverse motion sequences than existing techniques.
Researchers calculate the Laplace transform of a geometric Brownian motion integral.
problem Calculating the Laplace transform of a specific integral functional of geometric Brownian motion.
method Analytical calculation of the Laplace transform of the cumulative distribution and probability density functions.
result The Laplace transform of the integral functional of geometric Brownian motion is derived.
Researchers created a continuous Markov martingale that mimics Brownian motion but lacks the strong Markov property.
problem Constructing a continuous Markov martingale with Brownian marginals that misses the strong Markov property.
method Developed a new approach to create a continuous Markov martingale that differs from Brownian motion in terms of the strong Markov property.
result A continuous Markov martingale with Brownian marginals that lacks the strong Markov property was successfully constructed.
We consider n n n -dimensional discrete motions such that any two neighbouring positions correspond in a pure rotation ("rotating motions"). In the Study quadric model of Euclidean displacements these motions correspond to quadrilateral nets with edges contained in the Study quadric ("rotation nets"). The main focus of ou…
Improved vehicle motion prediction with uncertainty estimation.
problem Robust motion prediction for autonomous vehicles, especially under distributional shift.
method Presented an approach significantly improving the benchmark and taking 2nd place on the leaderboard.
result Significantly improved motion prediction and uncertainty measurement.