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

Trend · papers per month

10.6%21.3%31.9%42.6% · Jun 202019922001200920172026
48 results for algorithmic developments

Fast algorithms developed for adaptive and fully adaptive submodular maximization problems.

problem Maximizing submodular functions subject to constraints in linear time.
method Developed linear-time algorithms for two submodular maximization problems: adaptive and fully adaptive.
result Achieved (11/eε)(1-1/e-ε) approximation ratio for adaptive submodular maximization and $ rac{1-1/e-ε}{4-2/e-2ε}$ for fully adaptive submodular maximization.

FedML aims to improve FL research by providing a library and benchmark.

problem Inconsistent FL algorithm development and performance comparison.
method FedML offers an open research library and benchmark supporting diverse computing paradigms and flexible API design.
result FedML facilitates fair algorithm comparison and development in federated learning.

This thesis advances algorithms and software for QMC, GP, and sciML.

problem Efficient high-dimensional integration, interpolation, and PDE modeling.
method Developed new algorithms and software for QMC, GP, and sciML.
result Efficient and accurate methods for high-dimensional problems.

Developed a new algorithm to improve dynamic treatment regimens.

problem Non-convergence of Q-learning-based Q-shared algorithm in dynamic treatment regimens.
method Penalized Q-shared algorithm to address convergence issues.
result The penalized Q-shared algorithm converges and outperforms the original in various settings.

The dichotomous coordinate descent (DCD) algorithm has been successfully used for significant reduction in the complexity of recursive least squares (RLS) algorithms. In this work, we generalize the application of the DCD algorithm to RLS adaptive filtering in impulsive noise scenarios and derive a unified update formu…

2019-08-18abs ↗pdf ↗

Understanding and reasoning about physics is an important ability of intelligent agents. We develop the PHYRE benchmark for physical reasoning that contains a set of simple classical mechanics puzzles in a 2D physical environment. The benchmark is designed to encourage the development of learning algorithms that are sa…

2019-08-15abs ↗pdf ↗

Develops a high-dimensional differentially-private EM algorithm with near-optimal statistical guarantees.

problem Designing differentially-private EM algorithms for high-dimensional latent variable models.
method Noisy iterative hard-thresholding, statistical guarantees, near-optimal convergence rates.
result Near-optimal statistical guarantees and minimax rate optimality in high-dimensional settings.

Develops a new approach for algorithmic recourse in AI systems.

problem Tackles the problem of providing recommendations for reversing negative AI decisions.
method Introduces a causal framework that models recourse as a process over pre- and post-intervention outcomes, allowing for partial stability and resampling of latent variables.
result Demonstrates the value of the proposed methods on real and semi-synthetic datasets.

Paper develops federated GLMM algorithms for analyzing hierarchical data.

problem Analyzing hierarchical data with non-independent observations in a federated setting.
method Developed two federated GLMM algorithms using Laplace and Gaussian Hermite approximations.
result Federated GLMM can handle hierarchical data and achieve comparable or superior performance.

Kernel adaptive filters (KAF) are a class of powerful nonlinear filters developed in Reproducing Kernel Hilbert Space (RKHS). The Gaussian kernel is usually the default kernel in KAF algorithms, but selecting the proper kernel size (bandwidth) is still an open important issue especially for learning with small sample s…

2014-01-23abs ↗pdf ↗

Software development effort estimation is considered a fundamental task for software development life cycle as well as for managing project cost, time and quality. Therefore, accurate estimation is a substantial factor in projects success and reducing the risks. In recent years, software effort estimation has received …

2019-01-08abs ↗pdf ↗

Paper develops momentum schemes with variance reduction for non-convex composition optimization.

problem Lack of convergence guarantee and efficient momentum design in existing algorithms.
method Develops various momentum schemes with SPIDER-based variance reduction.
result Achieves near-optimal sample complexity and linear convergence rate.

New ML algorithms improve model interpretability without sacrificing performance.

problem Lack of interpretability in complex machine learning models.
method Developed new algorithms based on fANOVA framework, including GAMI-Lin-T and GAMI-Net.
result GAMI-Lin-T and GAMI-Net perform comparably to EBM and better in interpretability.

The paper develops ML algorithms for calibrating credit rating transition models for high and low default portfolios.

problem Calibration of credit rating transition models for high and low default portfolios.
method Developed Maximum likelihood (ML) algorithms, including Laplace approximation for high-default portfolios and particle filter with Gaussian process regression for low-default portfolios.
result Both algorithms produce accurate approximations of the likelihood function and ML estimates of model parameters.

Develops an algorithm for bilevel optimization with coupled constraints.

problem Challenges in bilevel optimization with coupled constraints.
method Primal-dual-assisted penalty approach and a fully first-order algorithm (BLOCC).
result Established rigorous convergence theory and demonstrated effectiveness on real-world applications.

Multi-layer optical film has been found to afford important applications in optical communication, optical absorbers, optical filters, etc. Different algorithms of multi-layer optical film design has been developed, as simplex method, colony algorithm, genetic algorithm. These algorithms rapidly promote the design and …

2018-12-07abs ↗pdf ↗

Variational Bayes (VB) has become a widely-used tool for Bayesian inference in statistics and machine learning. Nonetheless, the development of the existing VB algorithms is so far generally restricted to the case where the variational parameter space is Euclidean, which hinders the potential broad application of VB me…

2019-08-08abs ↗pdf ↗

This work develops secure distributed algorithms for machine learning to protect against data poisoning and network attacks.

problem Vulnerability of distributed machine learning algorithms to cyber threats.
method Game-theoretic framework to capture conflicting goals of a learner and an attacker, iterative distributed algorithm.
result Distributed SVM is prone to fail in different types of attacks, with impact depending on network structure and attack capabilities.

Pattern recognition and machine learning are becoming integral parts of algorithms in a wide range of applications. Different algorithms and approaches for machine learning include different tradeoffs between performance and computation, so during algorithm development it is often necessary to explore a variety of diff…

2014-06-21abs ↗pdf ↗

Boosted decision trees enjoy popularity in a variety of applications; however, for large-scale datasets, the cost of training a decision tree in each round can be prohibitively expensive. Inspired by ideas from the multi-arm bandit literature, we develop a highly efficient algorithm for computing exact greedy-optimal d…

2018-05-19abs ↗pdf ↗