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,982 papers · 148 categories

Trend · papers per month

1.6%3.2%4.9%6.5% · Sep 201919922001200920172026
48 results for mobile agents

Mobile sensing is an emerging technology that utilizes agent-participatory data for decision making or state estimation, including multimedia applications. This article investigates the structure of mobile sensing schemes and introduces crowdsourcing methods for mobile sensing. Inspired by social network, one can estab…

2015-08-03abs ↗pdf ↗

Mobile agents classify images via reinforcement learning and consensus.

problem Image classification using multiple mobile agents.
method Proposed network architecture for local belief formation and feature extraction. Decentralized consensus protocol using reinforcement learning.
result Effectiveness of the proposed framework demonstrated on MNIST dataset.

Deep actor-critic learning optimizes power control in mobile networks.

problem Optimizing power control in large-scale wireless mobile networks.
method Multi-agent deep reinforcement learning with deep deterministic policy gradient.
result The algorithm maximizes a global utility function in a distributed manner.

In this paper, we investigate the economic mobility in some money transfer models which have been applied into the research on wealth distribution. We demonstrate the mobility by recording the time series of agents' ranks and observing their volatility. We also compare the mobility quantitatively by employing an index,…

2005-07-21abs ↗pdf ↗

Neural pedagogical agent updates user models in real-time for mobile education apps.

problem Real-time user modeling for dynamic mobile education platforms.
method Bidirectional recurrent neural networks with attention mechanism over embedded question-response pairs.
result Model outperforms existing approaches in predicting user response correctness.

CTGAN synthesizes population data for travel behavior simulation.

problem Synthesizing population data for agent-based transportation modeling.
method Composite Travel Generative Adversarial Network (CTGAN).
result Consistent and accurate generation of synthetic populations with tabular and sequential mobility data.

Safe-M3^3-UCRL learns safe policies for multi-agent systems with global constraints.

problem Global constraints in mean-field reinforcement learning for multi-agent systems.
method Safe-M3^3-UCRL uses epistemic uncertainty and log-barrier approach to ensure constraints satisfaction.
result Safe-M3^3-UCRL learns safe policies for multi-agent systems with global constraints.

Recently, in order to explore the mechanism behind wealth or income distribution, several models have been proposed by applying principles of statistical mechanics. These models share some characteristics, such as consisting of a group of individual agents, a pile of money and a specific trading rule. Whatever the trad…

2005-07-21abs ↗pdf ↗

MDLdroid improves mobile deep learning for personal sensing with faster training.

problem Continuous local changes and resource constraints in personal mobile sensing affect global model performance.
method ChainSGD-reduce approach to reduce overhead and balance resources.
result 2x to 3.5x faster training on off-the-shelf mobile devices compared to single-device training.

A decentralized routing framework for lunar exploration robots.

problem Routing data in intermittent connectivity lunar networks.
method Graph Attention-based Multi-Agent Reinforcement Learning (GAT-MARL).
result Higher delivery rates, no duplications, fewer packet losses.

In important applications involving multi-task networks with multiple objectives, agents in the network need to decide between these multiple objectives and reach an agreement about which single objective to follow for the network. In this work we propose a distributed decision-making algorithm. The agents are assumed …

2018-12-20abs ↗pdf ↗

A decentralized policy achieves logarithmic regret for multi-agent MAB problems with communication constraints.

problem Decentralized policy for multi-agent MAB problems with option availability and communication constraints.
method Upper Confidence Bound (UCB) algorithms with non-stationary stochastic communication protocol.
result Guaranteed logarithmic regret for non-fully connected spatial graphs with communication constraints.

Review of recent advances in decentralized MARL with networked agents.

problem Sequential decision-making by networked agents without central coordination.
method Analysis of recent algorithms and their theoretical foundations.
result Inspiring more research in this challenging area.

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 have studied numerically the statistical mechanics of the dynamic phenomena, including money circulation and economic mobility, in some transfer models. The models on which our investigations were performed are the basic model proposed by A. Dragulescu and V. Yakovenko [1], the model with uniform saving rate develop…

2005-07-21abs ↗pdf ↗

We study the effect of the social stratification on the wealth distribution on a system of interacting economic agents that are constrained to interact only within their own economic class. The economical mobility of the agents is related to its success in exchange transactions. Different wealth distributions are obtai…

2005-05-23abs ↗pdf ↗

Agent-based model compares different COVID-19 testing policies and their effectiveness.

problem Understanding how different testing policies reveal the true number of infected cases.
method Developed an agent-based simulation framework in Python to model various testing policies and interventions.
result Contact Tracing consistently captures more positive cases than Random Symptomatic Testing, and LBT performs similarly.

New setting combines state evolution and corrupted context for better decision-making.

problem Decision-making in a changing state with unreliable context.
method Proposes a new algorithm using a referee to dynamically combine contextual bandit and multi-armed bandit policies.
result Improved empirical performance compared to existing algorithms.

Study allocates resources to strategic agents while balancing cost and incentives.

problem Dynamic allocation of reusable resources to strategic agents with private valuations under long-term cost constraints.
method Incentive-aware framework combining epoch-based lazy updates and randomized exploration rounds.
result Achieves ildeO(T) ilde{\mathcal{O}}(\sqrt{T}) social welfare regret, satisfies all cost constraints, and ensures incentive alignment.

Sample efficiency is critical in solving real-world reinforcement learning problems, where agent-environment interactions can be costly. Imitation learning from expert advice has proved to be an effective strategy for reducing the number of interactions required to train a policy. Online imitation learning, which inter…

2018-06-12abs ↗pdf ↗

This is a brief survey of the research performed by Grandata Labs in collaboration with numerous academic groups around the world on the topic of human mobility. A driving theme in these projects is to use and improve Data Science techniques to understand mobility, as it can be observed through the lens of mobile phone…

2018-12-03abs ↗pdf ↗

A novel decentralized deep learning algorithm using gradient-based optimization.

problem Decentralized deep learning in networked systems without a central server.
method Heavy-ball acceleration method and consensus protocol for model and gradient-momentum sharing.
result The proposed algorithm outperforms competing methods in various communication topologies.

The paper presents a probabilistic method to discover daily human mobility patterns from mobile data.

problem Discovering daily human mobility patterns from mobile data.
method A non-parameter Bayesian modeling method, Infinite Gaussian Mixture Model, combined with Kullback-Leibler divergence for automatic clustering.
result The IGMM-based algorithm outperforms the GMM-based algorithm in discovering mobility patterns.

FLAME auto-labels mobile data efficiently on diverse processors.

problem Accurately and efficiently labeling mobile data with unknown labels on heterogeneous processors.
method Self-adaptive auto-labeling system Flame that schedules and executes workloads on mobile processors.
result Flame achieves high labeling accuracy and performance on heterogeneous mobile processors.

Paper proposes MAMRL for efficient energy dispatch in self-powered edge computing systems.

problem High energy consumption in self-powered edge computing systems.
method Developed a semi-distributed data-driven MAMRL framework to solve a two-stage linear stochastic programming problem.
result The proposed MAMRL framework reduces up to 11% non-renewable energy usage and 22.4% energy cost.

Graphs model human mobility patterns, reducing errors in data matching.

problem Lack of high-quality data and computational resources for graph-based mobility analysis.
method Embedding graphs into a continuous space to address matching, modeling, and visualization challenges.
result Approx 40% decrease in error on average in matched graphs vs unmatched ones.

MobILE learns from expert demonstrations without access to actions, achieving strong performance guarantees.

problem Imitation Learning from Observations alone (ILFO) where actions are not observed.
method MobILE integrates optimism in the face of uncertainty into distribution matching IL framework, trading off exploration and imitation.
result MobILE provides strong performance guarantees for certain MDP dynamics and demonstrates efficacy on OpenAI Gym tasks.

New models predict mobility flows as well as complex machine learning but are simpler and interpretable.

problem Incomplete understanding and modeling of human mobility flows.
method Developed simple machine-learned, closed-form models of mobility.
result These models predict mobility flows more accurately than gravity or complex machine/deep learning models.

A new neural approach for generating origin-destination matrices in ABMs.

problem Challenges in generating origin-destination matrices for ABMs, including discretisation errors and inability to explore multimodal distributions.
method A computationally efficient framework that learns trip intensity through a neural differential equation, operating directly on the discrete combinatorial space.
result Outperforms prior art in terms of reconstruction error and ground truth matrix coverage, at a fraction of the computational cost.

Mobile big data contains vast statistical features in various dimensions, including spatial, temporal, and the underlying social domain. Understanding and exploiting the features of mobile data from a social network perspective will be extremely beneficial to wireless networks, from planning, operation, and maintenance…

2016-09-30abs ↗pdf ↗

TraLFM models human mobility patterns from traffic trajectories.

problem Understanding human mobility patterns from traffic data.
method Latent factor modeling of sequential, personal, and temporal factors.
result TraLFM significantly outperforms state-of-the-art methods in latent factor analysis and next location prediction.