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

Trend · papers per month

1.1%2.2%3.3%4.3% · Nov 199619922001200920172026
48 results for Mobile SoCs

SOC-ICNN expands neural network representational capacity by using conic optimization.

problem Restrictive representational capacity of ReLU-based ICNNs.
method Proposes SOC-ICNN architecture that uses Second-Order Cone Programming.
result SOC-ICNN strictly expands representational space without increasing complexity.

Avalanches, or Avalanche-like, events are often observed in the dynamical behaviour of many complex systems which span from solar flaring to the Earth's crust dynamics and from traffic flows to financial markets. Self-organized criticality (SOC) is one of the most popular theories able to explain this intermittent char…

2007-05-30abs ↗pdf ↗

This paper is a study of the relationship between two constructions associated with Cartan geometries, both of which involve Lie algebroids: the Cartan algebroid, due to [Blaom A.D., Trans. Amer. Math. Soc. 358 (2006), 3651-3671], and tractor calculus [Cap A., Gover A.R., Trans. Amer. Math. Soc. 354 (2001), 1511-1548].

2009-06-14abs ↗pdf ↗

An interesting toy model has recently been proposed on Schumpeterian economic dynamics by Thurner {\it et al.} following the idea of economist Joseph Schumpeter. Punctuated equilibrium dynamics is shown to emerge from this model and some detail analyses of the time series indicate SOC kind of behaviours. The focus in t…

2010-12-29abs ↗pdf ↗

Study uses machine learning to predict soil organic carbon content in northern Iran.

problem Estimating soil organic carbon content for understanding soil functions.
method Applied machine learning algorithms including DNN, SVM, ANN, etc., with genetic algorithm feature selection.
result DNN model showed highest accuracy with low prediction error and uncertainty.

Unified framework extends adjoint Schrödinger bridge sampler to discrete spaces.

problem Challenges in learning discrete neural samplers due to gradients and combinatorial complexity.
method Introduces discrete ASBS, a unified framework that extends adjoint Schrödinger bridge sampler to discrete spaces.
result Empirically, discrete ASBS achieves competitive sample quality with significant advantages in training efficiency and scalability.

Recent changes to greenhouse gas emission policies are catalyzing the electric vehicle (EV) market making it readily accessible to consumers. While there are challenges that arise with dense deployment of EVs, one of the major future concerns is cyber security threat. In this paper, cyber security threats in the form o…

2018-06-07abs ↗pdf ↗

Adjoint Matching improves flow and diffusion models with reward fine-tuning.

problem Improving generative models with reward fine-tuning.
method Casting reward fine-tuning as stochastic optimal control (SOC) and enforcing a specific noise schedule.
result Adjoint Matching outperforms existing SOC algorithms.

The question we address here is of whether phenomena of collective bankruptcies are related to self-organized criticality. In order to answer it we propose a simple model of banking networks based on the random directed percolation. We study effects of one bank failure on the nucleation of contagion phase in a financia…

2001-11-30abs ↗pdf ↗

Recent uses of differential geometry in materials science are reviewed here, in particular the September issue of the Phil. Trans. Royal Soc., entitled ``Curvature and chemical Structure.''

1996-11-12abs ↗pdf ↗

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 ↗

SDG uses optimal control to improve classifier guidance in low-density regions.

problem Inefficient guidance in low-density regions of posterior distributions.
method Integrates stochastic optimal control with Stein variational inference to compute the steepest descent direction.
result SDG improves guidance in low-density regions, outperforming standard methods.

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 ↗

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.

The Stock Market is a complex self-interacting system, characterized by an intermittent behaviour. Periods of high activity alternate with periods of relative calm. In the present work we investigate empirically about the possibility that the market is in a self-organized critical state (SOC). A wavelet transform metho…

2004-05-12abs ↗pdf ↗

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.

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.

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 ↗

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.

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.

Recently, large-scale cascading failures in complex systems have garnered substantial attention. Such extreme events have been treated as an integral part of the self-organized criticality (SOC). Recent empirical work has suggested that some extreme events systematically deviate from the SOC paradigm, requiring a diffe…

2015-02-24abs ↗pdf ↗

Proposes a method to predict content preferences for mobile users in decentralized caching networks.

problem Determining caching schemes for decentralized caching networks with mobile traffic.
method Formulates content preference learning as a DRMTL problem, integrates mobility prediction, and uses ADMM for optimization.
result Mobility-aware content preference learning provides more accurate predictions and improved hit ratios.

In this work, we analyze the problem of adoption of mobile money in Pakistan by using the call detail records of a major telecom company as our input. Our results highlight the fact that different sections of the society have different patterns of adoption of digital financial services but user mobility related feature…

2017-11-13abs ↗pdf ↗

Extracts patterns from mobile network data for better resource management.

problem Improving network efficiency and resource allocation for mobile users.
method Spatiotemporal analysis of internet activity records (IARs) data.
result Developed a mobile traffic partitioning scheme.

SplitEasy trains ML models on mobile devices without server data transfer.

problem Training complex DL models on resource-limited mobile devices.
method Split learning approach where sensitive layers are trained locally, computationally intensive layers on server.
result SplitEasy trains models on mobile devices with minimal data transfer, near-constant time per sample.

Mobility datasets are fundamental for evaluating algorithms pertaining to geographic information systems and facilitating experimental reproducibility. But privacy implications restrict sharing such datasets, as even aggregated location-data is vulnerable to membership inference attacks. Current synthetic mobility data…

2018-11-30abs ↗pdf ↗

The paper proves the existence of a tubular neighborhood for Finsler submanifolds.

problem Existence of a tubular neighborhood for Finsler submanifolds.
method Geometric proof of the existence of a tubular neighborhood for Finsler submanifolds.
result The distance between a Finsler submanifold and its cut locus is at least ε when the submanifold is compact.

Understanding the spatiotemporal distribution of people within a city is crucial to many planning applications. Obtaining data to create required knowledge, currently involves costly survey methods. At the same time ubiquitous mobile sensors from personal GPS devices to mobile phones are collecting massive amounts of d…

2012-07-03abs ↗pdf ↗

Paper proposes Q-learning for efficient aerial BS placement to improve fairness in mobile networks.

problem Optimal placement of aerial base stations to enhance fairness in a dynamic user mobility environment.
method Reinforcement learning approach to solve the NP-hard problem of 3D placement.
result Simulation results show increased fairness among users with a reasonable computing time and solution close to optimal.