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

1223 · Jan 202019922001200920172026
48 results for activity-based workspace

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.

Bayesian calibration improves ABMs for predicting travel patterns.

problem Calibrating ABMs for accurate travel pattern predictions.
method Gaussian Process emulator with deep learning dimensionality reduction for high-dimensional, non-stationary data.
result Improved accuracy in predicting travel patterns using traffic flow data.

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 ↗

Study develops a new model for predicting individual mobility based on activity patterns.

problem Existing mobility prediction methods overlook underlying activity patterns.
method Activity-based hidden Markov model (IOHMM) using transit smart card data.
result Proposed model achieves similar prediction performance to LSTM but also provides behavioral insights.

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 ↗

Unified Bayesian model explains in-context learning and activation steering in LLMs.

problem Understanding and controlling the behavior of large language models (LLMs) through prompts and activations.
method Developed a Bayesian model to explain and predict the effects of in-context learning and activation steering.
result Unified model predicts distinct phases and sudden shifts in LLM behavior, explaining prior empirical phenomena.

A new model synthesizes population with fewer structural and sampling zeros.

problem Synthesizing a feasible and diverse synthetic population from limited data.
method A deep generative model with two regularizations to minimize structural zeros and preserve sampling zeros.
result The model significantly improves feasibility and diversity of synthetic populations.

Initializing the weights and the biases is a key part of the training process of a neural network. Unlike the subsequent optimization phase, however, the initialization phase has gained only limited attention in the literature. In this paper we discuss some consequences of commonly used initialization strategies for va…

2019-03-27abs ↗pdf ↗

Improved neural network verification using Lagrangian decomposition and parallel algorithms.

problem Formally proving input-output properties of neural networks efficiently.
method Novel bounding and branching algorithms based on Lagrangian Decomposition and activation-based heuristics.
result Significant reduction in verification times, up to 50x faster on adversarial robustness properties.

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 ↗

Early stopping in meta-learning improved by analyzing neural activation patterns.

problem Early stopping in few-shot learning is challenging due to distributional shifts between meta-validation and meta-test sets.
method Activation-Based Early-stopping (ABE) analyzes hidden layer activations from unlabelled support examples to detect when target generalization diverges from source data.
result Simple activation statistics can effectively estimate target generalization, improving few-shot transfer learning across various algorithms and datasets.

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 ↗

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.

Efficiently selects seed nodes to maximize content influence in unknown social networks.

problem Maximizing content spread in social networks with unknown network model.
method Formulated as an infinite-horizon discounted MDP, uses model-based reinforcement learning to select seed users adaptively.
result Established a regret bound of O~(T)\widetilde O(\sqrt{T}) for the algorithm.

We can compare the expressiveness of neural networks that use rectified linear units (ReLUs) by the number of linear regions, which reflect the number of pieces of the piecewise linear functions modeled by such networks. However, enumerating these regions is prohibitive and the known analytical bounds are identical for…

2018-10-08abs ↗pdf ↗

GNNs improve brain activity forecasting in fMRI studies.

problem Understanding neural dynamics in the brain.
method Comparison of GNN architectures for modeling fMRI data.
result GNNs outperform VAR models in robustly scaling to large network studies.

LEWIS merges LLMs without training, improving performance on specific tasks.

problem Limited performance improvement of merged models on specific benchmarks.
method Guided model merging using layer-wise sparsity and task-vector pruning.
result Improved model performance by up to 11.3% on math-solving tasks.

Deep learning generates efficient change-point detection methods.

problem Detecting change-points in data with various types of change and data behavior.
method Train a neural network to automatically generate detection methods.
result Neural network-based methods are competitive and outperform standard methods in various noise conditions.

Tool detects tax evasion on social media using multi-modal deep learning.

problem Detecting tax evasion on social media platforms.
method Developed a multi-modal deep neural network combining comments, hashtags, and images.
result Multi-modal deep neural network achieved AUC of 0.808 and F1 score of 0.762.

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 ↗

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 ↗

Unified framework recovers exact input from SOM activation patterns.

problem Generating high-dimensional data from Self-Organizing Maps (SOMs).
method Inverting SOM activation patterns to recover input, using linear system and Tikhonov regularization.
result MUSIC framework produces coherent semantic transitions and maintains high classifier confidence.

New method for estimating lead-lag times between non-synchronously observed point processes.

problem Estimating lead-lag relationships between non-synchronously observed point processes.
method Formulate lead-lag estimation as CPCF shape estimation; propose kernel density estimation-based lead-lag time estimator.
result Proposed method delivers superior numerical performance and effective lead-lag time estimation.

Paper develops exact convex optimization for neural networks with polynomial activations.

problem Training two-layer neural networks with nonlinear polynomial activations.
method Exact convex optimization using semidefinite programming.
result Global optimization of neural networks is polynomial-time computable.

Agent-based simulation assesses tradable credit schemes for congestion reduction.

problem Simplistic modeling of TCS impacts in transportation research.
method Agent- and activity-based simulation framework within SimMobility.
result TCS stabilizes network and market performance over time, reducing congestion.

We propose a principle for exploring context in machine learning models. Starting with a simple assumption that each observation may or may not depend on its context, a conditional probability distribution is decomposed into two parts: context-free and context-sensitive. Then by employing the log-linear word production…

2019-01-10abs ↗pdf ↗

Dynamic pruning during training reduces deep network complexity without significant accuracy loss.

problem High memory and computational requirements of deep networks during training and inference.
method Dynamic pruning of convolutional filters during training, using L1 normalization for optimization.
result L1 normalization-based pruning yields up to 50% reduction in filters with minimal accuracy loss.