Spacematch matches office workers with suitable workspaces based on their preferences.
problem Matching workers with suitable workspaces in ABW environments.
method Developed a web-based mobile app to collect occupant preferences and IoT sensors for real-time environmental feedback.
result Occupant preferences can be segmented and matched to build a recommendation platform.
Shared workspace improves neural module coordination in deep learning.
problem Pairwise interactions in deep learning models lack global coordination.
method Introduce a shared global workspace with bandwidth limitations among neural modules.
result Capacity limitations encourage specialization and synchronization.
GWN improves multimodal data fusion accuracy for chronic pain patients.
problem Dynamic and unspecified uncertainties in multimodal data fusion.
method Inspired by Global Workspace Theory, GWN is a neural network architecture that dynamically attends to multiple modalities.
result GWN achieved higher F1 scores (0.92 and 0.75) for multimodal discrimination and classification tasks.
Reinforcement Learning (RL) has emerged as an efficient method of choice for solving complex sequential decision making problems in automatic control, computer science, economics, and biology. In this paper we present a model-free RL algorithm to synthesize control policies that maximize the probability of satisfying h…
NVIDIA cuDNN is a low-level library that provides GPU kernels frequently used in deep learning. Specifically, cuDNN implements several equivalent convolution algorithms, whose performance and memory footprint may vary considerably, depending on the layer dimensions. When an algorithm is automatically selected by cuDNN,…
Tripod spiders' energy control analyzed for Hooke and Coulomb potentials.
problem Control of tripod spiders' energy configurations.
method Morse theory for Hooke potential, stationary charges for Coulomb energy.
result For positive charges in a regular triangle, the domain of robust control is non-void.
Autonomous robots need to interact with unknown, unstructured and changing environments, constantly facing novel challenges. Therefore, continuous online adaptation for lifelong-learning and the need of sample-efficient mechanisms to adapt to changes in the environment, the constraints, the tasks, or the robot itself a…
Fast and efficient motion planning algorithms are crucial for many state-of-the-art robotics applications such as self-driving cars. Existing motion planning methods become ineffective as their computational complexity increases exponentially with the dimensionality of the motion planning problem. To address this issue…
OPFython simplifies Optimum-Path Forest for Python users.
problem Lack of diversity and complexity in conventional classification algorithms.
method Develops a Python-based Optimum-Path Forest framework.
result OPFython provides a more friendly and faster prototyping environment.
Proposes Learnergy, a Python framework for energy-based machine learning.
problem Lack of research and implementations around energy-based systems.
method Built upon PyTorch, Learnergy provides a more friendly environment and faster prototyping.
result Learnergy speeds up computational time using CUDA.
We consider model-based reinforcement learning (MBRL) in 2-agent, high-fidelity continuous control problems -- an important domain for robots interacting with other agents in the same workspace. For non-trivial dynamical systems, MBRL typically suffers from accumulating errors. Several recent studies have addressed thi…
Hydra boosts efficiency for long-context reasoning in resource-constrained settings.
problem Quadratic complexity of transformers limits long-context reasoning in resource-constrained systems.
method Hydra uses a modular architecture with adaptive routing between sparse global attention, mixture-of-experts, and dual memories.
result Hydra achieves significant throughput and accuracy improvements for long-context reasoning.
New framework models epistemic uncertainty in GNNs using random sets.
problem Uncertainty in graph neural network predictions.
method Introduces a belief function (random set) approach to model epistemic uncertainty in GNNs.
result Demonstrates superior uncertainty quantification on various graph datasets.
JuliaConnectoR integrates Julia functions into R for deep learning.
problem Accessing Julia algorithms from R.
method TCP-based binary format, optimized for data exchange; interactive use in R.
result Makes Julia functions and variables directly available in R workspace.
In this paper we define and study flexible links and flexible isotopy in projective space. Flexible links are meant to capture the topological properties of real algebraic links. We classify all flexible links up to flexible isotopy using Ekholms interpretation of Viros encomplexed writhe.
The authors characterize flexibility in power and energy markets considering time, spatiality, resource, and risk.
problem Evaluating and maximizing flexibility in power systems and markets.
method Characterization of flexibility dimensions (time, spatiality, resource, risk) and their interrelations with flexibility assets, products, and services.
result Flexibility should be evaluated based on multiple dimensions for efficient power systems and markets.
TASO optimizes CNN models for memory-constrained devices.
problem Large CNN models are too resource-intensive for mobile devices.
method Integer Linear Programming (ILP) for selecting operations and workspace allocation.
result 8x speedup and 2.2x reduction in memory usage compared to greedy algorithms.
New inequality for odd-degree flexible curves using surface doubling.
problem Bounding the number of non-empty ovals of odd-degree flexible curves.
method Defining an Arnold surface for odd-degree flexible curves and using it to derive a Viro--Zvonilov-type inequality.
result Upper bound on the number of non-empty ovals of odd-degree flexible curves.
Automates detection of fast-ramped flexibility events for DSOs.
problem Monitoring and supervising flexibility activations in power systems.
method Unsupervised detection and open-set classification.
result Automatically identifies critical flexibility activations for early intervention.
Flexible surfaces found in complex projective and product spaces.
problem Finding flexible surfaces in complex projective and product spaces.
method Constructing flexible surfaces within prescribed homology classes.
result Flexible surfaces exist in both CP2 and S2imesS2. Polyhedra called Siamese dipyramids are known to be non-flexible, however their physical models behave like physical models of flexible polyhedra. We discuss a simple mathematical method for explaining the model flexibility of the Siamese dipyramids.
TUV Austria proposes certification for ML applications to ensure reliability.
problem Ensuring trust in AI applications to meet societal reliance requirements.
method Holistic approach analyzing security, functionality, data quality, ethics, and criticality levels.
result Certification process for low-risk ML applications in supervised learning.
The recent popularity of deep neural networks (DNNs) has generated a lot of research interest in performing DNN-related computation efficiently. However, the primary focus is usually very narrow and limited to (i) inference -- i.e. how to efficiently execute already trained models and (ii) image classification networks…
In this paper we study infinitesimal and finite flexibility for generic semidiscrete surfaces. We prove that generic 2-ribbon semidiscrete surfaces have one degree of infinitesimal and finite flexibility. In particular we write down a system of differential equations describing isometric deformations in the case of exi…
In this paper we study geometric, algebraic, and computational aspects of flexibility and infinitesimal flexibility of Kokotsakis meshes. A Kokotsakis mesh is a mesh that consists of a face in the middle and a certain band of faces attached to the middle face by its perimeter. In particular any 3x3-mesh made of quadran…
Weiss and, independently, Mazzeo and Montcouquiol recently proved that a 3--dimensional hyperbolic cone-manifold (possibly with vertices) with all cone angles less than 2π is infinitesimally rigid. On the other hand, Casson provided 1998 an example of an infinitesimally flexible cone-manifold with some of the cone an…
Characterizes rigid and flexible hyperbolic cone metrics and billiards.
problem Understanding the rigidity and flexibility of hyperbolic cone metrics and their billiard dynamics.
method Characterization through Liouville currents and deformation spaces.
result Generic rigidity and parameterization of deformation spaces for flexible metrics.
The paper defines flexible domains for minimal surfaces in Euclidean spaces and explores their properties.
problem Understanding the flexibility of domains in Euclidean spaces for minimal surfaces.
method Investigates the concept of flexibility in terms of minimal surfaces contained in domains.
result Defines flexible domains and shows how they can be approximated by minimal immersions.
Adma proposes a flexible loss function for neural networks.
problem Static loss functions limit neural network performance.
method Introduces a flexible loss function that adapts to ANN complexity and data distribution.
result Flexible loss function achieves state-of-the-art performance.
Study shows non-existence of certain contact structures on odd-dimensional manifolds.
problem Existence of contact structures with flexible pages on odd-dimensional manifolds.
method Proved a topological obstruction and used symplectic actions to show non-existence.
result Non-existence of contact open books with flexible pages for certain manifolds.
Flexible metrics found on a genus 2 surface.
problem Identifying non-rigid hyperbolic cone metrics on a genus 2 surface.
method Using a theorem by Erlandsson, Leininger, and Sadanand.
result Nine mapping class group orbits of non-rigid metrics found.
Tensor models decode human perception and memory using SPO triples.
problem Understanding implicit and explicit perception and memory in the brain.
method Tensor models with SPO triples, dual representations, and four layers.
result Semantic memory is crucial for explicit perception and declarative memories.
We discuss several rigidity and flexibility phenomena in the context of Poisson geometry.
Flexible model for complex relationships using Bayesian nonparametrics.
problem Complex relationships between variables not well captured by simple models.
method Hierarchical generation of nonlinear features, Bayesian inference, variable selection.
result Find interpretable models with a small set of important features.
Extends Hawkes process for flexible residual modeling in point processes.
problem Modeling high-frequency financial data with complex residual distributions.
method Introduces self and mutually exciting point process with discretely Markovian dynamics.
result Flexible residual distributions improve intensity modeling and high-frequency data estimation.
Frengression models causal data flexibly and faithfully.
problem Challenges in robust benchmarking and evaluation of causal inference with real-world data.
method Introduces frengression, a deep generative model for joint distribution of covariates, treatments, and outcomes.
result Frengression provides accurate estimation and flexible simulation of multivariate, time-varying data.
Establishes jet transversality for regular maps from flexible manifolds.
problem Transversality for regular maps in algebraic geometry.
method Algebraic version of Forstnerič's theorem for holomorphic maps.
result Genericity theorems for regular maps of maximal ranks.
Flexible links have symplectic representatives in complex projective space.
problem Existence of symplectic representatives for flexible links.
method Construction of a symplectic surface invariant under complex conjugation.
result No obstructions to finding symplectic representatives beyond classical topology.
New ADMM method for PARAFAC2 tensor decomposition with flexible regularization.
problem Challenges in applying regularisation to the evolving mode of PARAFAC2.
method Alternating Direction Method of Multipliers (AO-ADMM) for PARAFAC2 tensor fitting.
result The proposed ADMM-based approach accurately recovers underlying components from simulated data.
Flexible per-class regularization improves binary classifiers.
problem Improving binary classifiers by addressing outliers and class imbalance.
method Graph-based adaptive regularization with flexible per-class thresholds.
result Flexible thresholds improve classifier performance and address class imbalance.
We show that surface groups are flexibly stable in permutations. This is the first non-trivial example of a non-amenable flexibly stable group. Our method is purely geometric and relies on an analysis of branched covers of hyperbolic surfaces. Along the way we establish a quantitative variant of the LERF property for s…
Shows flexible sheaves as fibrant objects for Gromov's h-principle.
problem Applying the h-principle to partial differential relations.
method Interprets flexible sheaves as fibrant objects in a model structure.
result Flexible sheaves can be understood as fibrant objects.
GARIM theory explains how conscious manipulation of internal representations enhances goal-directed behavior.
problem Limited understanding of how consciousness supports flexible goal-directed cognition.
method Extending a three-component theory of flexible cognition, proposing GARIM theory.
result Conscious states actively manipulate internal representations to align with goals, enhancing flexibility.
Improved algorithm for optimal stopping problems reduces runtime.
problem Optimal stopping problems with infinite time horizon and random discounting.
method Flexible forward improvement iteration with a variable look-ahead distance.
result The new algorithm converges and can significantly reduce runtime.
We introduce and discuss notions of regularity and flexibility for Lagrangian manifolds with Legendrian boundary in Weinstein domains. There is a surprising abundance of flexible Lagrangians. In turn, this leads to new constructions of Legendrians submanifolds and Weinstein manifolds. For instance, many closed n-mani…
New PAC-Bayesian framework for flexible meta-learning.
problem Limitations in transferring knowledge between tasks in meta-learning.
method PAC-Bayesian theory applied to learning the learning algorithm.
result Flexibility in meta-learning mechanisms and improved prediction quality.
Combines MCTM and NF for flexible multivariate density regression with interpretable marginals.
problem Difficult interpretation of flexible NF models and limitations of MCTM in flexibility.
method Hybrid approach combining MCTM for interpretable marginals and NF for complex joint distributions.
result Demonstrates versatility and improved performance compared to MCTM and other NF models.
TM-VI uses flexible transformation models to approximate complex posteriors in Bayesian models.
problem Approximating complex posteriors in Bayesian models with limited flexibility.
method Transformation models for variational inference (TM-VI).
result TM-VI allows accurate approximation of complex posteriors in models with one parameter and works in a mean-field fashion for multi-parameter models.