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

Trend · papers per month

114228342456 · Jun 202019922001200920172026
48 results for HTML analysis

HTMLPhish detects phishing web pages using deep learning on HTML content.

problem Growing phishing attacks on the web require new detection methods.
method HTMLPhish uses Convolutional Neural Networks (CNNs) to classify HTML documents as phishing or benign.
result HTMLPhish achieves over 93% accuracy in detecting phishing web pages.

This work includes all the technical details of the Sequential Principal Curves Analysis (SPCA) in a single document. SPCA is an unsupervised nonlinear and invertible feature extraction technique. The identified curvilinear features can be interpreted as a set of nonlinear sensors: the response of each sensor is the pr…

2016-06-02abs ↗pdf ↗

I introduce Forecastable Component Analysis (ForeCA), a novel dimension reduction technique for temporally dependent signals. Based on a new forecastability measure, ForeCA finds an optimal transformation to separate a multivariate time series into a forecastable and an orthogonal white noise space. I present a converg…

2012-05-21abs ↗pdf ↗

The task of clustering a set of objects based on multiple sources of data arises in several modern applications. We propose an integrative statistical model that permits a separate clustering of the objects for each data source. These separate clusterings adhere loosely to an overall consensus clustering, and hence the…

2013-02-28abs ↗pdf ↗

We present a novel method for obtaining high-quality, domain-targeted multiple choice questions from crowd workers. Generating these questions can be difficult without trading away originality, relevance or diversity in the answer options. Our method addresses these problems by leveraging a large corpus of domain-speci…

2017-07-19abs ↗pdf ↗

When faced with high frequency streams of data, clustering raises theoretical and algorithmic pitfalls. We introduce a new and adaptive online clustering algorithm relying on a quasi-Bayesian approach, with a dynamic (i.e., time-dependent) estimation of the (unknown and changing) number of clusters. We prove that our a…

2016-02-01abs ↗pdf ↗

WebGUM learns web navigation from multimodal data, outperforming previous methods.

problem Limited generalization from domain-specific models in web navigation.
method Instruction-following multimodal agent trained on vision-language foundation models.
result Significant improvement in web navigation performance on benchmarks.

bioLeak addresses data leakage in biomedical machine learning studies.

problem Data leakage causes optimistic bias in machine learning models for biomedical studies.
method bioLeak provides leakage-aware resampling workflows and model audits in R.
result The package supports various machine learning tasks and can detect leakage mechanisms.

A persistent lamination for a knot K is an essential lamination in the complement of K, which remains essential after every non-trivial Dehn surgery along K. Having a persistent lamination implies, for example, that every manifold obtained by non-trivial Dehn surgery along K has universal cover R^3. In this paper we pr…

1998-07-24abs ↗pdf ↗

Research characterizes intersection cohomology groups of gauge theories and cotangent bundles.

problem Characterizing intersection cohomology groups of Coulomb branch gauge theories.
method Uses geometric Satake correspondence for Kac-Moody settings.
result Sketches proof of conjecture in affine type A.

TableQnA answers web queries about lists and superlatives from HTML tables.

problem Answer web queries about lists and superlatives from HTML tables.
method Extract intent from queries, use structure-aware matching, and train models with automatic data generation.
result Significantly higher precision and coverage for list and superlative queries.

Modern machine learning algorithms are increasingly computationally demanding, requiring specialized hardware and distributed computation to achieve high performance in a reasonable time frame. Many hyperparameter search algorithms have been proposed for improving the efficiency of model selection, however their adapta…

2018-07-13abs ↗pdf ↗

We propose a method to classify the causal relationship between two discrete variables given only the joint distribution of the variables, acknowledging that the method is subject to an inherent baseline error. We assume that the causal system is acyclicity, but we do allow for hidden common causes. Our algorithm presu…

2016-11-04abs ↗pdf ↗

Building agents to interact with the web would allow for significant improvements in knowledge understanding and representation learning. However, web navigation tasks are difficult for current deep reinforcement learning (RL) models due to the large discrete action space and the varying number of actions between the s…

2019-02-19abs ↗pdf ↗

A new video prediction model treats videos as continuous processes, reducing sampling steps and improving efficiency.

problem Efficiency and temporal coherence in video prediction models.
method Treats videos as a continuous multi-dimensional process, reducing sampling steps.
result Reduction of 75% sampling steps, state-of-the-art performance on benchmark datasets.

The study examines Euclid's Book I, focusing on area applications and construction methods.

problem Exploring Euclid's geometric constructions and proofs, particularly those involving area calculations.
method Summarizing medieval editions and ancient commentaries, comparing constructions and proofs.
result Medieval editions often avoid Euclid's use of superposition in area proofs, offering alternative constructions.

We develop an iterative subsampling approach to improve the computational efficiency of our previous work on solution path clustering (SPC). The SPC method achieves clustering by concave regularization on the pairwise distances between cluster centers. This clustering method has the important capability to recognize no…

2014-12-04abs ↗pdf ↗

Correlation filters (CFs) are a class of classifiers that are attractive for object localization and tracking applications. Traditionally, CFs have been designed in the frequency domain using the discrete Fourier transform (DFT), where correlation is efficiently implemented. However, existing CF designs do not account …

2014-11-10abs ↗pdf ↗

Machine Learning (ML) is one of the most exciting and dynamic areas of modern research and application. The purpose of this review is to provide an introduction to the core concepts and tools of machine learning in a manner easily understood and intuitive to physicists. The review begins by covering fundamental concept…

2018-03-23abs ↗pdf ↗

Paper introduces kernel methods for detecting anomalous changes in remote sensing imagery.

problem Detecting anomalous changes in remote sensing imagery.
method Nonlinear extension of Gaussian and elliptically contoured distribution algorithms using reproducing kernel Hilbert space.
result Improved detection accuracy and reduced false-alarm rates compared to linear formulations.

We introduce a Bayesian nonparametric regression model for data with multiway (tensor) structure, motivated by an application to periodontal disease (PD) data. Our outcome is the number of diseased sites measured over four different tooth types for each subject, with subject-specific covariates available as predictors.…

2019-01-31abs ↗pdf ↗

GrokAlign aligns Jacobians to accelerate grokking in deep networks.

problem Accelerating the training dynamics of deep networks to avoid delayed generalisation and robustness.
method Aligning the Jacobians of a deep network with the training data to ensure grokking under a low-rank assumption.
result GrokAlign regularizes Jacobians to induce grokking sooner than conventional methods.

MaskCycleGAN-VC improves voice conversion without parallel data.

problem Limited ability to convert mel-spectrogram data without parallel data.
method Integrates a novel auxiliary task called filling in frames (FIF) to learn time-frequency structures.
result MaskCycleGAN-VC outperforms existing methods with similar model size.

Network learns graph matching directly from edge affinity matrices.

problem Graph matching optimization based on edge-to-edge affinity matrices.
method Embedding network for vertex classification, Sinkhorn normalization, cross-entropy loss, matching-aware constraints, dummy nodes.
result Competitive performance on synthetic and real-world graphs, faster than state-of-the-art.

CycleGAN-VC3 improves CycleGAN-VCs for mel-spectrogram conversion.

problem Ambiguity in CycleGAN-VC/VC2 effectiveness for mel-spectrogram conversion.
method Proposes CycleGAN-VC3 with time-frequency adaptive normalization (TFAN).
result CycleGAN-VC3 outperforms or matches CycleGAN-VC2 for mel-spectrogram conversion.