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

Trend · papers per month

71143214285 · Jun 202019922001200920172026
48 results for site-specific practices

A site-specific Gordian distance between two spatial embeddings of an abstract graph is the minimal number of crossing changes from one to another where each crossing change is performed between two previously specified abstract edges of the graph. It is infinite in some cases. We determine the site-specific Gordian di…

2017-03-28abs ↗pdf ↗

Paper proposes a privacy-preserving method for estimating complex models.

problem Lack of flexibility in existing model classes for approximating data-generating processes.
method Privacy-preserving distributed estimation of generalized additive mixed models using component-wise gradient boosting.
result Proposed algorithm yields equivalent model estimates as component-wise gradient boosting on pooled data.

Generative model learns wireless channel distributions efficiently.

problem Learning precise wireless channel distributions for optimal communication.
method Physics-informed sparse Bayesian generative modeling (SBGM) with compressed data.
result Model learns channel parameters from compressed AP observations, is physically interpretable, and generalizes across different systems.

Meta-analysis improves personalized treatment rules across multiple sites.

problem Lack of generalizability in learning individualized treatment rules across different medical sites.
method Developed a method for individual-level meta-analysis of ITRs, borrowing sign-coherency information between sites.
result Jointly learned site-specific ITRs with improved generalizability.

Flooding is a destructive and dangerous hazard and climate change appears to be increasing the frequency of catastrophic flooding events around the world. Physics-based flood models are costly to calibrate and are rarely generalizable across different river basins, as model outputs are sensitive to site-specific parame…

2019-10-15abs ↗pdf ↗

New method combines regional HIV prevention trial data without sharing individual patient info.

problem Regional differences in HIV prevention efficacy, privacy concerns, and data sharing limitations.
method Federated learning approach that combines site-specific estimators via L1-regularization.
result Improved precision in estimating region-specific survival curves.

fedCI and fedCI-IOD enable federated causal discovery across diverse datasets with privacy and power enhancements.

problem Causal discovery across multiple datasets with privacy constraints and heterogeneity.
method federated conditional independence test (fedCI) and Integration of Overlapping Datasets (IOD) algorithm extension (fedCI-IOD).
result fedCI-IOD achieves comparable performance to fully pooled analyses, enhancing statistical power and privacy.

GOPSA optimizes EEG data for cross-site age prediction, improving performance on multiple metrics.

problem Predictive shifts in EEG data from different sites and participants.
method Geodesic Optimization for Predictive Shift Adaptation (GOPSA) on the SPD manifold.
result Significantly higher performance on age prediction metrics compared to state-of-the-art methods.

Gluon optimizes LMO-based methods for large-scale tasks, improving performance and theory-practice gap.

problem LMO-based methods lack theoretical support for practical implementation and smoothness assumptions.
method Introduces Gluon, a new LMO-based method with refined smoothness model.
result Gluon's theoretical stepsizes match fine-tuned values, closing the theory-practice gap.

Semi-supervised wrapper methods are concerned with building effective supervised classifiers from partially labeled data. Though previous works have succeeded in some fields, it is still difficult to apply semi-supervised wrapper methods to practice because the assumptions those methods rely on tend to be unrealistic i…

2016-11-12abs ↗pdf ↗

The study compares machine learning models for depression detection and highlights the importance of feature selection.

problem The choice of features in machine learning models for depression detection is crucial.
method Comparison of seven machine learning models on depression detection tasks.
result Optimal feature selection is essential for accurate and clinically acceptable classification solutions.

Study assesses environmental management accounting practices in Bangladesh.

problem Low environmental management accounting practices in Bangladeshi manufacturing companies.
method Developed a compliance checklist and evaluated practices using binary scoring.
result Environmental management accounting practices are poor in Bangladeshi manufacturing companies.

New framework provides privacy guarantees for practical federated learning.

problem Inadequate privacy guarantees for federated learning due to restrictive assumptions.
method Fed-α\alpha-NormEC, integrating multiple local updates, partial client participation, and standard assumptions.
result Provably convergent and differentially private federated learning framework.

In the Best-KK identification problem (Best-KK-Arm), we are given NN stochastic bandit arms with unknown reward distributions. Our goal is to identify the KK arms with the largest means with high confidence, by drawing samples from the arms adaptively. This problem is motivated by various practical applications and…

2017-05-19abs ↗pdf ↗

NTK theory fails to predict practical behavior of large-width neural networks.

problem Theoretical limits of NTK do not match practical neural network architectures.
method Empirical investigation of NTK's applicability to large-width architectures.
result Practically relevant behavior of large-width architectures differs from NTK theory.

In several realistic situations, an interactive learning agent can practice and refine its strategy before going on to be evaluated. For instance, consider a student preparing for a series of tests. She would typically take a few practice tests to know which areas she needs to improve upon. Based of the scores she obta…

2017-06-07abs ↗pdf ↗

BLAE solves batched linear bandits with optimal regret and practical performance.

problem Batched linear bandit problem with limited adaptivity.
method Integrates arm elimination with regularized G-optimal design, achieving minimax optimal regret.
result Achieves minimax optimal regret in both large-KK and small-KK regimes with O(loglogT)O(\log\log T) batches.

A practical one-shot federated learning algorithm for cross-silo setting.

problem Limited applicability of existing one-shot federated learning algorithms due to specific model support and lack of privacy guarantees.
method FedKT, a one-shot federated learning algorithm that supports any classification models and provides differential privacy guarantees.
result FedKT significantly outperforms other state-of-the-art federated learning algorithms with a single communication round.

Study highlights how lazy data practices in fair ML research can unfairly impact minority groups.

problem Lazy data practices in fair ML research can unfairly impact minority groups.
method Systematic study of 280 experiments across 142 publications on 142 datasets.
result Unreflective data practices lead to biased findings and unfair treatment of minorities.

This thesis improves practical reinforcement learning methods with robustness, scalability, and efficiency.

problem Improving reinforcement learning methods for practical applications.
method Analyzes and develops robust, scalable, and efficient reinforcement learning algorithms.
result Proves the efficiency and robustness of new RL methods.

Good sparse approximations are essential for practical inference in Gaussian Processes as the computational cost of exact methods is prohibitive for large datasets. The Fully Independent Training Conditional (FITC) and the Variational Free Energy (VFE) approximations are two recent popular methods. Despite superficial …

2016-06-15abs ↗pdf ↗

New algorithm ensures global convergence in deep neural networks beyond NTK regime.

problem Existing global convergence guarantees do not apply to practical deep networks.
method Proposes an algorithm with global convergence guarantees under the expressivity condition.
result Algorithm ensures global convergence in practical settings beyond NTK regime.

Practical algorithm for contextual bandits with large action spaces.

problem Efficient algorithms for decision making in large, continuous action spaces.
method Uses computational oracles for supervised learning and optimization over the action space.
result Achieves sample complexity, runtime, and memory independent of the size of the action space.

New method AnInfoNCE uncovers latent factors in contrastive learning with practical variability.

problem Theoretical assumptions of contrastive learning loss overlook practical variability in positive pairs.
method AnInfoNCE, a generalization of InfoNCE, models anisotropic variability to uncover latent factors.
result AnInfoNCE increases recovery of latent factors in CIFAR10 and ImageNet, albeit at the cost of accuracy.

PRoA assesses deep learning robustness against practical functional perturbations.

problem Inadequate practical robustness verification methods for deep learning systems.
method Probabilistic robustness assessment based on adaptive concentration.
result Statistical guarantees on probabilistic robustness against functional perturbations.

Addresses theoretical and practical aspects of Gaussian differential privacy.

problem Theoretical and practical challenges in privacy-preserving data analysis.
method Discussion of f-differential privacy and Gaussian differential privacy.
result Gaussian differential privacy can enhance privacy in various applications.

Differentially private learning on real-world data poses challenges for standard machine learning practice: privacy guarantees are difficult to interpret, hyperparameter tuning on private data reduces the privacy budget, and ad-hoc privacy attacks are often required to test model privacy. We introduce three tools to ma…

2018-12-07abs ↗pdf ↗

Stochastic Gradient Descent (SGD) is widely used in machine learning problems to efficiently perform empirical risk minimization, yet, in practice, SGD is known to stall before reaching the actual minimizer of the empirical risk. SGD stalling has often been attributed to its sensitivity to the conditioning of the probl…

2017-02-01abs ↗pdf ↗

Despite widespread interest and practical use, the theoretical properties of random forests are still not well understood. In this paper we contribute to this understanding in two ways. We present a new theoretically tractable variant of random regression forests and prove that our algorithm is consistent. We also prov…

2013-10-04abs ↗pdf ↗