Research
On-device research index

arXiv research

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.

168,695 papers · 148 categories

Trend · papers per month

3469103137 · May 202619922001200920172026
48 results for global workspace

We propose a novel neural network architecture, named the Global Workspace Network (GWN), which addresses the challenge of dynamic and unspecified uncertainties in multimodal data fusion. Our GWN is a model of attention across modalities and evolving through time, and is inspired by the well-established Global Workspac…

2020-01-26abs ↗pdf ↗

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.

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,…

2018-04-13abs ↗pdf ↗

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.

Machine learning techniques have been paramount throughout the last years, being applied in a wide range of tasks, such as classification, object recognition, person identification, and image segmentation. Nevertheless, conventional classification algorithms, e.g., Logistic Regression, Decision Trees, and Bayesian clas…

2020-01-28abs ↗pdf ↗

We analyse perception and memory, using mathematical models for knowledge graphs and tensors, to gain insights into the corresponding functionalities of the human mind. Our discussion is based on the concept of propositional sentences consisting of \textit{subject-predicate-object} (SPO) triples for expressing elementa…

2020-01-29abs ↗pdf ↗

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…

2018-06-14abs ↗pdf ↗

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…

2019-01-29abs ↗pdf ↗

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…

2018-03-16abs ↗pdf ↗

This thesis explores GNNs, categorizing them into local and global approaches.

problem Understanding the convergence of global GNNs and connecting local and global approaches.
method Categorization of GNNs into local and global, study of Invariant Graph Networks, connecting local and global approaches, and using local MPNN for graph coarsening.
result Established a connection between local and global GNN approaches.

Global methods outperform local in forecasting groups of time series, even in heterogeneous datasets.

problem Forecasting groups of time series, especially in heterogeneous datasets.
method Local methods consider each series separately, global methods fit a single model to all series.
result Global methods can outperform local methods in forecasting groups of time series, even in heterogeneous datasets.

Global calculus for manifolds with boundary, solving evolution problems.

problem Global solvability of evolution problems on manifolds with boundary.
method Established global functional calculus and Gårding inequality for pseudo-differential operators without local coordinates.
result Global solvability for a class of evolution problems.

Global optimization in Bayesian inference yields little additional benefit.

problem Improving psychometric parameter estimation using global optimization strategies.
method Experimental simulations comparing myopic and global strategies in multiple models.
result Global optimization strategies provide negligible additional utility improvement beyond the immediate next steps.

Combines global and local search for efficient global optimization with Gaussian processes.

problem Difficulties in building accurate GP models and getting stuck in suboptimal regions.
method Adopting AGLGP model combining global and local GP models, dividing space into regions, and switching between global and local searches.
result Efficiently locates the global optimum with benefits of both global and local search.

Global implicit function theorem for Fréchet spaces, solving derivative loss problems.

problem Solving initial value problems with derivative loss in Fréchet spaces.
method Global implicit function theorems for Keller's Cc1C_c^1-mappings in Fréchet spaces, applied through submersions and transversality.
result Global existence and uniqueness of solutions to initial value problems with derivative loss.

Improves global counterfactual explanations for model recourse.

problem Inability to provide explanations beyond local instances.
method Investigates and improves Actionable Recourse Summaries (AReS) for global counterfactual explanations.
result Develops more efficient and interactive explainability tools.

Graph products inherit Morse local-to-global property from their components.

problem Generalizing local-to-global property to graph products of infinite groups.
method Generalizing maximization procedure for relatively hierarchically hyperbolic groups and showing stable embeddings.
result Graph products of infinite Morse local-to-global groups have the Morse local-to-global property.

Study curve flows with global forcing terms using a distance comparison principle.

problem Analyse the behavior of curves under curve flows with global forcing terms.
method Prove a distance comparison principle for curve shortening flow with arbitrary global forcing terms.
result Established a distance comparison principle for curve flows with global forcing terms.

A new deep generative model captures global dependencies without supervision.

problem Global modeling in deep generative models.
method Non-i.i.d. variational autoencoders with mixture model and global Gaussian latent variable.
result Captures interpretable disentangled representations and domain alignment.

We show that the definition of global hyperbolicity in terms of the compactness of the causal diamonds and non-total imprisonment can be extended to spacetimes with continuous metrics, while retaining all of the equivalences to other notions of global hyperbolicity. In fact, global hyperbolicity is equivalent to the co…

2014-12-07abs ↗pdf ↗

We study global aspects of complete, non-singular asymptotically locally AdS spacetimes solving the vacuum Einstein equations whose conformal infinity is an arbitrary globally stationary spacetime. It is proved that any such solution which is asymptotically stationary to the past and future is itself globally stationar…

2006-05-31abs ↗pdf ↗

Global invariant for path structures and differential equations defined on torus.

problem Global invariant for path structures and differential equations.
method Computed as a secondary invariant from a Cartan connection on a canonical bundle.
result Formula for global invariant of second order differential equations on torus.

Study describes global sections of chiral de Rham complex on compact Ricci-flat Kähler manifolds.

problem None explicitly stated; focuses on description of global sections.
method Complete description of vertex algebra of global sections.
result Complete description of vertex algebra of global sections of chiral de Rham complex.

Smooth distributions on subcartesian spaces can be globally finitely generated.

problem Understanding smooth distributions on subcartesian spaces.
method Embedding in Euclidean space, Whitney Embedding Theorem, and distribution theory.
result Smooth generalized distributions and subbundles on connected subcartesian spaces are globally finitely generated.

Global fixed income returns span across multiple maturities and economies, that is, they naturally reside on multi-dimensional data structures referred to as tensors. In contrast to standard "flat-view" multivariate models that are agnostic to data structure and only describe linear pairwise relationships, we introduce…

2019-08-06abs ↗pdf ↗

It has been shown that deep neural networks (DNNs) may be vulnerable to adversarial attacks, raising the concern on their robustness particularly for safety-critical applications. Recognizing the local nature and limitations of existing adversarial attacks, we present a new type of global adversarial attacks for assess…

2019-06-19abs ↗pdf ↗

Global models outperform local models in forecasting intermittent time series.

problem Forecasting intermittent time series with zeros in supply chains.
method Comparison of state-of-the-art probabilistic local and global models on five datasets.
result TiDE, a simple neural network architecture, achieves the best accuracy among global models.