A web browser should not be only for browsing web pages but also help users to find out their target websites and recommend similar type websites based on their behavior. Throughout this paper, we propose two methods to make a web browser more intelligent about link prediction which works during typing on address-bar a…
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,742 papers · 148 categories
Trend · papers per month
48 results for “Browser History”
Federated Learning improves Firefox URL bar suggestions.
problem Improving user typing efficiency in the Firefox URL bar.
method Federated Learning for privacy-preserving model training.
result Users type over half a character less to find what they want.
Web browser autofill predicts form field labels for convenience.
problem Predicting form field labels for autofill in web browsers.
method Machine learning solution implemented as a web service using Azure ML Studio.
result Improved form field label prediction for autofill.
Model predicts web page parallelism for improved browser performance and energy.
problem Improving browser performance and energy usage through parallelism.
method Supervised learning model using web page primitives and parallelism features.
result Model predicts parallelism and optimizes performance and energy usage.
In this paper we present Percival, a browser-embedded, lightweight, deep learning-powered ad blocker. Percival embeds itself within the browser's image rendering pipeline, which makes it possible to intercept every image obtained during page execution and to perform blocking based on applying machine learning for image…
Interactive tools help teach economics online.
problem Teaching macroeconomic models online.
method Browser-based simulation toolkits.
result Intuitive approach to comparative statics.
Extracts main content from web pages using neural sequence labeling.
problem Lack of generalization in existing web page content extraction models.
method Neural sequence labeling model using HTML tags and words as input.
result Model outperforms state-of-the-art and adapts to changes in web page structure.
Deep learning can achieve outstanding results in various fields. However, it requires so significant computational power that graphics processing units (GPUs) and/or numerous computers are often required for the practical application. We have developed a new distributed calculation framework called "Sashimi" that allow…
AI applications pose increasing demands on performance, so it is not surprising that the era of client-side distributed software is becoming important. On top of many AI applications already using mobile hardware, and even browsers for computationally demanding AI applications, we are already witnessing the emergence o…
With few exceptions, the field of Machine Learning (ML) research has largely ignored the browser as a computational engine. Beyond an educational resource for ML, the browser has vast potential to not only improve the state-of-the-art in ML research, but also, inexpensively and on a massive scale, to bring sophisticate…
Masked LARk prevents cross-site tracking while training models.
problem Cross-site tracking of user data through third-party cookies.
method Secure multi-party compute (MPC) protocol with masking.
result Prevents cross-site tracking and maintains model training flexibility.
Boilerplate removal refers to the problem of removing noisy content from a webpage such as ads and extracting relevant content that can be used by various services. This can be useful in several features in web browsers such as ad blocking, accessibility tools such as read out loud, translation, summarization etc. In o…
Deep learning methods have shown extraordinary potential for analyzing very diverse biomedical data, but their dissemination beyond developers is hindered by important computational hurdles. We introduce ImJoy (https://imjoy.io/), a flexible and open-source browser-based platform designed to facilitate widespread reuse…
Bayesian inference over admissible histories leads to irreversible kinetics.
problem Modeling irreversible processes in systems with uncertain histories.
method A Gibbs-type measure weighted by energy-dissipation action and observation constraints, interpreted as a Bayesian posterior.
result The measure concentrates on maximum-a-posteriori (MAP) histories, recovering classical deterministic evolution.
HS-FNO models non-Markovian PDEs by learning history and future states.
problem Non-Markovian dynamics where future states depend on past history.
method History-Space Fourier Neural Operator (HS-FNO) for delay and memory-driven PDEs.
result HS-FNO achieves lowest aggregate errors across various PDE families.
Affine surface areamath.DG
Overview of affine surface area and its history.
problem None explicitly stated; focuses on overview.
method None explicitly stated; focuses on overview.
result None explicitly stated; focuses on overview.
Survey on DDVV-type inequalities, their history, and recent developments.
problem None explicitly stated; focuses on surveying existing work.
method None explicitly stated; focuses on surveying existing work.
result Survey of DDVV-type inequalities and their history and recent developments.
SRMC framework reduces Monte Carlo variance by history-based sampling in high-dimensional spaces.
problem Efficient sampling in high-dimensional discrete or continuous state spaces.
method Score-Repellent Monte Carlo (SRMC) framework that summarizes history through running average of score evaluations.
result Improves estimator variance and mode coverage with constant memory usage.
Paper analyzes history-based RL methods for MDPs, introduces a theoretical framework and practical algorithm.
problem Improving RL performance in MDPs using history-based features.
method Theoretical framework for history-based RL, practical algorithm design.
result Practical RL algorithm shows effectiveness on continuous control tasks.
Neural networks improve cancer risk prediction from family history data.
problem Improving cancer risk prediction from family history data using machine learning.
method Developed and trained neural network models on large pedigrees to predict hereditary cancers.
result Neural networks can achieve nearly optimal prediction performance and outperform traditional models in misreported data.
The paper explains why estimating a history-dependent policy can reduce MSE in reinforcement learning.
problem Understanding why history-dependent policies can improve MSE in off-policy evaluation.
method The paper derives a bias-variance decomposition of MSE for various OPE estimators, showing how history-dependent policies can decrease variance and increase bias.
result History-dependent policies can decrease the variance of importance sampling estimators, leading to lower MSE.
It is shown how the generating functional method of De Dominicis can be used to solve the dynamics of the original version of the minority game (MG), in which agents observe real as opposed to fake market histories. Here one again finds exact closed equations for correlation and response functions, but now these are de…
This paper suggests claim history will be deprecated in future auto insurance rates.
problem The role of historical claim records in auto insurance rates.
method Proposes a new risk variable elimination method and real-time road risk model design.
result Claim history will be considered a 'noise' factor and deprecated in Pay-How-You-Drive models.
History of Knot Theorymath.GT
We present in this chapter (Chapter II) the history of ideas which lead up to the development of modern knot theory. We are more detailed when pre-XX century history is reported. With more recent times we are more selective, stressing developments related to Jones type invariants of links. In the Appendix, A.Przybyszew…
MILJS is a collection of state-of-the-art, platform-independent, scalable, fast JavaScript libraries for matrix calculation and machine learning. Our core library offering a matrix calculation is called Sushi, which exhibits far better performance than any other leading machine learning libraries written in JavaScript.…
Paper tackles reinforcement learning for STL specifications with state history.
problem Learning optimal policies to satisfy STL specifications often requires too much state history, making the problem computationally intractable.
method Proposes a compact augmented state-space representation to capture state history and an approximation method to solve the objective.
result Shows the performance bound of the approximate solution and compares it with an existing technique.
We propose an online algorithm for cumulative regret minimization in a stochastic multi-armed bandit. The algorithm adds i.i.d. pseudo-rewards to its history in round and then pulls the arm with the highest average reward in its perturbed history. Therefore, we call it perturbed-history exploration (PHE). Th…
Production recommendation systems rely on embedding methods to represent various features. An impeding challenge in practice is that the large embedding matrix incurs substantial memory footprint in serving as the number of features grows over time. We propose a similarity-aware embedding matrix compression method call…
We propose a new online algorithm for cumulative regret minimization in a stochastic linear bandit. The algorithm pulls the arm with the highest estimated reward in a linear model trained on its perturbed history. Therefore, we call it perturbed-history exploration in a linear bandit (LinPHE). The perturbed history is …
We give an explicit definition of decentralization and show you that decentralization is almost impossible for the current stage and Bitcoin is the first truly noncentralized currency in the currency history. We propose a new framework of noncentralized cryptocurrency system with an assumption of the existence of a wea…
Cold-start PV forecasting uses synthetic histories to train time-series foundation models.
problem Cold-start PV forecasting
method Zero-shot pipeline with synthetic histories
result TabPFN-TS achieves the lowest error under Real Feedback strategy
Epsilon-machines are minimal, unifilar presentations of stationary stochastic processes. They were originally defined in the history machine sense, as hidden Markov models whose states are the equivalence classes of infinite pasts with the same probability distribution over futures. In analyzing synchronization, though…
Combining deep learning and ensemble smoothers for better history matching.
problem Dealing with complex facies distributions in history matching.
method Using autoencoders and generative adversarial networks to parameterize facies models, applying distance-based localization.
result Improved history matching performance with deep learning parameterizations.
New framework handles dynamic contexts in reinforcement learning.
problem Learning in environments where contexts change over time.
method Dynamic Contextual Markov Decision Processes (DCMDPs) with logistic aggregation.
result Upper-confidence-bound style algorithm with regret bounds.
A dangerously brief history of the developments of the main ideas in economics, as observed by a physicist, is given. This was published in 'Econophysics of Stock and Other Markets', Eds. A. Chatterjee, B. K. Chakrabarti, New Economic Windows Series, Springer, Milan, 2006, pp~219-224.
Transformers improve Alzheimer's disease progression prediction by accounting for irregular biomarker histories.
problem Difficult prediction of medium-horizon Alzheimer's disease progression due to tied clinical scores and irregular biomarker observations.
method Developed a residual gap-aware transformer that combines statistical reference with transformer-based residual learning.
result The proposed model reduces mean error and improves prediction-observation correlation compared to baseline models.
Foundation models improve wage gap decomposition by capturing omitted career history factors.
problem Estimating wage disparities using incomplete career history data.
method Fine-tuning foundation models to mitigate omitted variable bias and estimate wage gaps.
result Foundation models can decompose gender wage gaps more accurately than traditional econometric methods.
Marden's Tameness Conjecture predicts that every hyperbolic 3-manifold with finitely generated fundamental group is homeomorphic to the interior of a compact 3-manifold. It was recently established by Agol and Calegari-Gabai. We will survey the history of work on this conjecture and discuss its many applications.
Network growth processes can be understood as generative models of the structure and history of complex networks. This point of view naturally leads to the problem of network archaeology: reconstructing all the past states of a network from its structure---a difficult permutation inference problem. In this paper, we in…
Bäcklund transformations for smooth and ``space discrete'' Hashimoto surfaces are discussed and a geometric interpretation is given. It is shown that the complex curvature of a discrete space curve evolves with the discrete nonlinear Schrödinger equation (NLSE) of Ablowitz and Ladik, when the curve evolves with the Has…
Deep Learning Framework for History Matching CO2 Storage with 4D Seismic and Monitoring Well Datacs.LG
Deep learning calibrates CO2 storage formations from seismic and well data.
problem Uncertainty in CO2 storage formation properties.
method Two deep learning models for well and seismic data, integrated into MCMC history matching.
result Significant uncertainty reduction in key parameters and accurate CO2 plume predictions.
A new method uses a frozen language model to improve sample efficiency in reinforcement learning.
problem Improving sample efficiency in reinforcement learning with partially observable environments.
method FROZEN Hopfield network and HELM (History Embedding Language Model) method.
result HELM achieves new state-of-the-art results on Minigrid and Procgen environments.
HDT improves MCMC on graphs with history-dependent sampling.
problem Efficient sampling from target distributions on general graphs with low computational overhead.
method History-driven target (HDT) framework that replaces the original target distribution with a history-dependent one.
result Near-zero variance performance and scalability to large graphs with memory-efficient implementation.
Rhino learns causal relationships from time series data with history-dependent noise.
problem Discovering causal relationships from time series data with non-linear relations, instantaneous effects, and history-dependent noise.
method Combines vector auto-regression, deep learning, and variational inference.
result Demonstrates better causal relationship discovery performance compared to baselines.
Proposes using frequent sequences to improve sequential recommendation models.
problem Combining user history and recent actions for personalized recommendations.
method Uses frequent sequences to identify relevant parts of user history, embedding items based on preferences and dynamics in a unified metric model.
result Outperforms state-of-the-art methods, especially on sparse datasets.
Explains the history and challenges of minimal surfaces.
problem Understanding the regularity of minimal surfaces.
method Historical overview and technical analysis.
result Outlines the evolution and current state of minimal surfaces.
Can an interdisciplinary field contribute to one of the parent disciplines from which it emerged?physics.soc-ph
In the light of contemporary discussions of inter and transdisciplinarity, this paper approaches econophysics and sociophysics to seek a response to the question -- whether these interdisciplinary fields could contribute to physics and economics. Drawing upon the literature on history and philosophy of science, the pap…
Auto-regressive sequence-to-sequence models with attention mechanism have achieved state-of-the-art performance in many tasks such as machine translation and speech synthesis. These models can be difficult to train. The standard approach, teacher forcing, guides a model with reference output history during training. Th…