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.

169,051 papers · 148 categories

Trend · papers per month

54109163217 · Jun 202019922001200920182026
48 results for hyperlink regression

BHLR predicts hyperlink weights from data vectors using symmetric similarity functions and Bregman divergence.

problem Predicting hyperlink weights from data vectors in a general framework.
method BHLR learns a symmetric similarity function to minimize Bregman-divergence between hyperlink weights and estimated similarities.
result BHLR is statistically consistent and computationally tractable, providing theoretical guarantees for various methods.

A hyperlink is a finite set of non-intersecting simple closed curves in R×R3\mathbb{R} \times \mathbb{R}^3. We compute the Wilson Loop observable using a path integral with an Einstein-Hilbert action. Using axial-gauge fixing, we can write this path integral as the limit of a sequence of Chern-Simons integrals, studied e…

2017-01-11abs ↗pdf ↗

A novel multilayer network approach for text analysis.

problem Clustering documents and finding topics in large collections with metadata and hyperlinks.
method Multilayer Networks and Stochastic Block Models applied to multiple data types.
result Taking into account multiple types of information improves topic and document clustering.

A hyperlink is a finite set of non-intersecting simple closed curves in R×R3\mathbb{R} \times \mathbb{R}^3. Let SS be an orientable surface in R3\mathbb{R}^3. The dynamical variables in General Relativity are the vierbein ee and a su(2)×su(2)\mathfrak{su}(2)\times\mathfrak{su}(2)-valued connection ωω. Together with Minkowski m…

2017-05-10abs ↗pdf ↗

Wiki-CS dataset benchmarks Graph Neural Networks using Wikipedia articles.

problem Benchmarking Graph Neural Networks on a new domain with structural differences.
method Derived from Wikipedia, nodes represent Computer Science articles, edges from hyperlinks, 10 classes for different branches, evaluated semi-supervised node classification and link prediction.
result Graph Neural Networks perform well on Wiki-CS, showing structural differences from earlier benchmarks.

We present the mixture-of-parents maximum entropy Markov model (MoP-MEMM), a class of directed graphical models extending MEMMs. The MoP-MEMM allows tractable incorporation of long-range dependencies between nodes by restricting the conditional distribution of each node to be a mixture of distributions given the parent…

2012-06-20abs ↗pdf ↗

In this paper we propose a Bayesian nonparametric approach to modelling sparse time-varying networks. A positive parameter is associated to each node of a network, which models the sociability of that node. Sociabilities are assumed to evolve over time, and are modelled via a dynamic point process model. The model is a…

2016-07-06abs ↗pdf ↗

Infrastructure monitors AI/ML radiology models across multiple sites.

problem Monitoring and improving AI/ML radiology models across multiple sites.
method Interactive radiology reporting, centralized cloud system, post-marketing surveillance.
result Efficient monitoring and iterative development of AI/ML models without radiologist burden.

Many data sets contain rich information about objects, as well as pairwise relations between them. For instance, in networks of websites, scientific papers, and other documents, each node has content consisting of a collection of words, as well as hyperlinks or citations to other nodes. In order to perform inference on…

2013-03-28abs ↗pdf ↗

Max-MIG tackles crowdsourced label learning without knowing crowd information structure.

problem Learning from crowds without knowing the information structure among crowds.
method Max-MIG is an information theoretic approach that simultaneously aggregates crowdsourced labels and learns a data classifier.
result Max-MIG achieves state-of-the-art results in most settings, including real-world data.

This paper studies robust regression in the settings of Huber's εε-contamination models. We consider estimators that are maximizers of multivariate regression depth functions. These estimators are shown to achieve minimax rates in the settings of εε-contamination models for various regression problems including nonpa…

2017-02-15abs ↗pdf ↗

This paper studies the nonparametric modal regression problem systematically from a statistical learning view. Originally motivated by pursuing a theoretical understanding of the maximum correntropy criterion based regression (MCCR), our study reveals that MCCR with a tending-to-zero scale parameter is essentially moda…

2017-02-20abs ↗pdf ↗

Neural regression trees convert regression to classification more effectively.

problem Suboptimal approaches for regression via classification.
method Joint optimization framework for learning optimal discretization thresholds and feature selection in a neural regression tree.
result Empirically validated as state-of-the-art on challenging regression tasks.

Survey of SDR methods for high-dimensional regression and embedding.

problem Reducing dimensionality in high-dimensional data.
method Involves both statistical and machine learning approaches, covering inverse and forward regression methods.
result Supervised Kernel Dimension Reduction is equivalent to supervised PCA.

This paper reviews SDR methods for multivariate response regression.

problem Handling sufficient dimension reduction for multivariate response regression.
method Characterizes SDR estimators as inverse or forward regression methods.
result Pooled marginal, projective resampling, distance-based, ordinary least squares, partial least squares, and semiparametric SDR estimators are discussed.

Paper introduces semi-supervised linear extremile regression for high-dimensional data.

problem Challenges in high-dimensional extremile regression due to data sparsity and overfitting.
method Proposes semi-supervised learning for linear extremile regression, achieving n\sqrt{n}-consistency.
result Demonstrates improved estimation efficiency and performance in high-dimensional settings.

Prevalidated ridge regression simplifies logistic regression for high-dimensional data.

problem Efficient probabilistic classification in high-dimensional data with logistic regression.
method Developed a prevalidated ridge regression model that matches logistic regression's performance but is more computationally efficient.
result Prevalidated ridge regression achieves similar classification error and log-loss to logistic regression for high-dimensional data.

We simplify complex regression coefficients using linearization and feature comparison.

problem Interpreting high-dimensional regression coefficients from nonlinear responses.
method Developed a linearization method to derive feature coefficients and compare them with regression coefficients.
result Shows how regression coefficients relate to linearized feature coefficients and how they change under regularization.

Unified framework for fair regression under demographic parity.

problem Ensuring fairness in regression tasks subject to demographic parity constraints.
method Proposes a unified framework applicable to various regression tasks with a broad spectrum of loss functions, derived a novel characterization of the fair risk minimizer, and established theoretical consistency and convergence rates.
result Effective minimization of risk while satisfying fairness constraints across various regression settings.

Huber regression assessed for robustness in statistical learning.

problem Understanding Huber regression in nonparametric statistical learning.
method Assessment from statistical learning perspective, focusing on risk consistency, adaptive tuning, and convergence rates.
result Huber regression can be asymptotically mean regression calibrated under (1+ε)(1+ε)-moment conditions, justifying its robustness.

Locally adaptive interpretable regression improves linear regression's predictability.

problem Linear regression's predictability is limited; it lacks adaptability.
method Locally adaptive interpretable regression (LoAIR) uses neural networks to predict percentile of a Gaussian distribution for regression coefficients.
result LoAIR achieves comparable or better predictive performance than state-of-the-art baselines.

The paper improves SVR with linear constraints for better model properties.

problem Improving Support Vector Regression with linear constraints.
method Generalized SMO algorithm for solving optimization with linear constraints.
result The proposed method shows better practical performance on various datasets.

We analyze coresets for regularized regression problems and propose a modified lasso that yields smaller coresets.

problem Analyzing coresets for regularized regression problems.
method Examined coresets for ridge regression and proposed a modified lasso problem.
result No coreset for regularized regression can be smaller than the unregularized version when reqsr eq s.

Least Angle Regression is a promising technique for variable selection applications, offering a nice alternative to stepwise regression. It provides an explanation for the similar behavior of LASSO (1\ell_1-penalized regression) and forward stagewise regression, and provides a fast implementation of both. The idea has…

2008-02-07abs ↗pdf ↗

DualIV simplifies non-linear IV regression via dual formulation.

problem Non-linear instrumental variable regression with potential first-stage regression bottleneck.
method Dual formulation of non-linear IV regression as a convex-concave saddle-point problem, leading to a kernel-based algorithm with analytic solution.
result Empirical results show competitive performance compared to existing algorithms.

Study uniform consistency in nonparametric mixture models and mixed regression.

problem Uniform consistency in nonparametric mixture models and mixed regression models.
method Construct uniformly consistent estimators under general conditions, develop novel technical tools.
result Prove uniform consistency results for nonparametric mixtures and mixed regression models.

Collider regression improves predictive performance in regression tasks.

problem Discarding prior causal knowledge in regression tasks.
method Collider regression framework incorporating probabilistic causal knowledge from collider structures.
result Proves positive generalization benefit and provides closed-form estimators.

New GP model estimates piecewise continuous functions.

problem Piecewise continuous regression functions in scientific and engineering applications.
method Local Gaussian process model with partitioned local data and joint estimation of boundaries.
result Superior performance over conventional GP models in estimating piecewise regression functions.

We describe dimensionally constrained symbolic regression which has been developed for mass measurement in certain classes of events in high-energy physics (HEP). With symbolic regression, we can derive equations that are well known in HEP. However, in problems with large number of variables, we find that by constraini…

2011-06-20abs ↗pdf ↗

This work analyzes Fréchet regression using comparison geometry, providing theoretical and practical insights.

problem Analyzing data on complex structures like manifolds and graphs.
method Theoretical analysis through comparison geometry, focusing on existence, uniqueness, and stability of the Fréchet mean.
result Key results on the existence, uniqueness, and stability of the Fréchet mean, along with statistical guarantees for nonparametric regression.

Study on reducing dimensionality in high-dimensional regression with kernel methods and stability analysis.

problem Analyzing errors in high-dimensional regression with dimensionality reduction and kernel regression.
method Derive a stability result for kernel regression with Wasserstein distance and apply it to PCA to deduce convergence rates.
result Two-step procedure yields useful convergence rates in semi-supervised settings.