Many machine learning models, such as logistic regression~(LR) and support vector machine~(SVM), can be formulated as composite optimization problems. Recently, many distributed stochastic optimization~(DSO) methods have been proposed to solve the large-scale composite optimization problems, which have shown better per…
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
48 results for “Scope function”
A standard model of (conditional) heteroscedasticity, i.e., the phenomenon that the variance of a process changes over time, is the Generalized AutoRegressive Conditional Heteroskedasticity (GARCH) model, which is especially important for economics and finance. GARCH models are typically estimated by the Quasi-Maximum …
SCOPE iteratively optimizes sparsity-constrained problems without tuning hyperparameters.
problem Optimizing sparsity-constrained problems in signal processing, statistics, and machine learning.
method SCOPE (Sparsity-Constrained Optimization via sPlicing itEration) replaces gradient steps with a splicing operation guided by the objective value.
result SCOPE achieves linear convergence and superior support recovery performance.
Improves material discovery through better model evaluation metrics.
problem Standard error metrics mislead in material discovery.
method Introduces Pareto shell-scope error for model evaluation.
result Novel diagnostic tools and insights for acquisition function design.
Tool uses text mining to define innovative tech fields from abstracts.
problem Defining scope in dynamic, multidisciplinary tech projects.
method Text mining of Elsevier's Scopus abstracts.
result Tool provides crucial information for tech field definition.
BAxUS optimizes high-dimensional functions adaptively, avoiding performance degradation and failure.
problem State-of-the-art HDBO methods degrade or fail with increasing dimensions.
method BAxUS uses nested random subspaces to adaptively optimize high-dimensional functions.
result BAxUS outperforms state-of-the-art methods across various applications.
Convolutional neural network improves assertion detection in multi-label clinical text.
problem Detecting assertions in multi-label clinical text with rich descriptions.
method Developed a CNN architecture for multi-label scope detection.
result At least 12% improvement over state-of-the-art on multi-label clinical text.
Emissions-Robust Portfoliosq-fin.MF
Study reduces emissions in portfolios with error-prone emissions data.
problem Portfolio optimization with firm-level emissions intensities measured inaccurately.
method Introduced a scope-specific penalty operator to rescale asset payoffs based on revenue-normalized emissions intensity.
result Reduces average Scope~1 emissions intensity by roughly 92% while maintaining similar Sharpe ratios.
New estimates for Green's functions in varying Kähler metrics.
problem Uniform estimates for Green's functions in Kähler metrics.
method Broadening techniques to allow complex structure variation and removing assumptions.
result Uniform estimates for Green's functions in families of canonical Kähler metrics.
Scoping review finds EEG key in MCI research, identifying ERP/EEG, QEEG, and machine learning.
problem Identifying MCI early and accurately.
method Scoping review with co-occurrence analysis and PAGER framework.
result Main research themes identified: ERP/EEG, QEEG, and EEG-based machine learning.
SCOPE-FE improves feature engineering efficiency for high-dimensional datasets.
problem Expanding and reducing feature space in tabular learning becomes computationally expensive with increased dimensionality.
method SCOPE-FE controls the search space by regulating operator and feature-pair spaces, using OperatorProbing and FeatureClustering.
result SCOPE-FE reduces feature engineering time while maintaining competitive predictive performance.
Bayesian approach improves SPN structure learning and performance.
problem Lack of principled Bayesian framework for SPN structure learning.
method Bayesian framework decomposes structure learning into graph layout and scope function learning.
result Bayesian SPNs often improve test likelihoods over greedy SPN learners.
SCOPE fuses categorical variable levels to estimate high-dimensional linear models.
problem Estimating high-dimensional linear models with nominal categorical data.
method SCOPE uses nonconvex concave penalties to fuse levels and achieve efficient computation.
result SCOPE achieves oracle least squares solution under certain conditions.
Deep Stacked Stochastic Configuration Networks for Lifelong Learning of Non-Stationary Data Streamscs.LG
The concept of SCN offers a fast framework with universal approximation guarantee for lifelong learning of non-stationary data streams. Its adaptive scope selection property enables for proper random generation of hidden unit parameters advancing conventional randomized approaches constrained with a fixed scope of rand…
Scoping review of EO-ML methods for causal inference in poverty geography.
problem Lack of thorough documentation and best practices for EO-ML methods in causal analysis.
method Comprehensive scoping review cataloging five principal approaches.
result Detailed protocol for integrating EO data into causal analysis.
Scoping review and benchmarking of synthetic EHR data generation methods.
problem Creating realistic synthetic electronic health records for research and training.
method Conducted a scoping review and benchmarked seven methods on open-source EHR datasets.
result GAN-based methods excel in fidelity and utility, while rule-based methods excel in privacy protection.
We prove that the hypotheses in the version of the Omori-Yau maximum principle that was given by Pigola-Rigoli-Setti are logically equivalent to the assumption that the manifold carries a proper function whose gradient and Hessian (Laplacian) are bounded. In particular, this result extends the scope of the origin…
Study finds carbon emissions affect stock value, but not bought emissions.
problem Determining if carbon emissions impact stock value and whether this is due to direct or indirect emissions.
method Fixed-effects analysis with propensity score weighting to control for selection bias.
result Firms with higher Scope 1 emissions have a statistically significant positive carbon premium, but Scope 2 emissions do not.
Two new estimators reduce costs and improve accuracy for EHR outcome prediction.
problem Sparse estimate distributions, high computational cost, and high sampling variance in EHR outcome prediction.
method Proposed SCOPE and REACH estimators that leverage next-token probability distributions.
result SCOPE and REACH match Monte Carlo accuracy with token reductions of 2.5-3.4 times and variance guarantees.
We develop a general theory of convex duality for certain singular control problems, taking the abstract results by Kramkov and Schachermayer (1999) for optimal expected utility from nonnegative random variables to the level of optimal expected utility from increasing, adapted controls. The main contributions are the f…
Studied SGD convergence under weak conditions.
problem Convergence of SGD in nonconvex optimization.
method Analyzed biased nonconvex SGD under mild conditions.
result Provided convergence rates and complexities.
The coeffective differential complex on a symplectic manifold is extended both in length and in scope, unifying the constructions of various other authors.
New CPWL functions for deep neural networks with practical applications in coding.
problem Expressivity of deep ReLU neural networks in high dimensions.
method Developed new families of CPWL functions and showed they can be computed by ReLU networks.
result Proved approximation error of CPWL functions by shallower networks and separation result.
Predicting Properties of Periodic Systems from Cluster Data: A Case Study of Liquid Waterphysics.comp-ph
Machine learning predicts liquid water properties from cluster data.
problem Accuracy of bulk properties from machine-learned potentials is limited by training data.
method Local, atom-centred descriptors enable prediction of bulk properties from cluster data.
result Excellent agreement with experimental and theoretical counterparts of liquid water properties.
The Hecke algebra H_n contains well known idempotents E_λ which are indexed by Young diagrams with n cells. They were originally described by Gyoja. A skein theoretical description of E_λ was given by Aiston and Morton. The closure of E_λ becomes an element Q_λ of the skein of the annulus. In this skein, they are known…
Integrating economic and psychological insights in binary choice models with social interactionsphysics.soc-ph
We investigate a class of binary choice models with social interactions. We propose a unifying perspective that integrates economic models using a utility function and psychological models using an impact function. A general approach for analyzing the equilibrium structure of these models within mean-field approximatio…
Clarifies the scope of 'reproducibility' in AI and ML.
problem Unclear meaning of 'reproducibility' in AI and ML.
method Analyzes the community's works on reproducibility.
result Identifies eight general topic areas of reproducibility.
Mathematical approach defines stability conditions for ML models.
problem Ensuring stability of machine learning models.
method Adopted topological and metric spaces theory to define stability.
result Stability of ML models depends on topological properties of classification sets.
In probabilistic approaches to classification and information extraction, one typically builds a statistical model of words under the assumption that future data will exhibit the same regularities as the training data. In many data sets, however, there are scope-limited features whose predictive power is only applicabl…
This paper presents the nonparametric inference for nonlinear volatility functionals of general multivariate Itô semimartingales, in high-frequency and noisy setting. Pre-averaging and truncation enable simultaneous handling of noise and jumps. Second-order expansion reveals explicit biases and a pathway to bias correc…
The small-ball method was introduced as a way of obtaining a high probability, isomorphic lower bound on the quadratic empirical process, under weak assumptions on the indexing class. The key assumption was that class members satisfy a uniform small-ball estimate: that for given const…
A new method calculates fractional moments using the moment-generating function.
problem Computing fractional moments from probability densities.
method Integral framework based on moment-generating function.
result Exact integral expressions for various types of moments.
Trained neural networks perform Bayesian reasoning for tasks beyond their initial scope.
problem Performing Bayesian reasoning for tasks outside the trained neural networks' initial scope.
method Used deep generative models as priors and classification/regression networks as constraints. Approximated Bayesian inference through variational or sampling techniques.
result The approach built on top of already trained networks, expanding the addressable questions.
Paper generalizes reparameterization trick for broader applicability.
problem Limited applicability of reparameterization trick to specific distributions.
method Introduces a generalized transformation-based gradient method.
result Proposed model combines advantages of control variates and generalized reparameterization.
Defines Learning Analytics' foundational structure and scope.
problem Lack of theoretical foundation in Learning Analytics.
method Proposes an axiomatic theory based on psychological learning and LA methodology.
result Clarifies the epistemological stance of Learning Analytics and its limitations.
SCOPE: Spectral Concentration by Distributionally Robust Joint Covariance-Precision Estimationstat.ML
SCOPE estimator improves covariance and precision matrix estimation.
problem Estimating covariance and precision matrices accurately.
method Distributionally robust optimization with convex spectral divergence.
result SCOPE estimator reduces spectral bias and improves condition number.
Extends gradient-based optimization to spline functions.
problem Limitations of standard differentiable programming methods.
method Derives Jacobian of spline functions and uses it in predictive models.
result Improved performance in various applications.
Paper develops efficient methods for estimating Hessian inverses in stochastic optimization.
problem Estimating the inverse Hessian for convex function minimization.
method Robbins-Monro procedure for recursive estimation of the inverse Hessian.
result Develops universal stochastic Newton methods with improved efficiency.
New method optimizes neural network learning by adjusting random parameters to target function features.
problem Difficulty in setting optimal random parameters for neural network learning.
method Adjusts sigmoid slopes and positions to target function features in a randomized learning method.
result Significantly better approximation of complex target functions compared to standard methods.
This paper examines how different loss functions affect neural network features and performance.
problem Investigating which loss function is best for deep neural networks.
method Examining last-layer features of deep networks and drawing inspiration from the Neural Collapse phenomenon.
result All relevant loss functions (CE, LS, FL, MSE) produce equivalent features and similar performance.
The paper tackles cooperative RL with function approximation, achieving near-optimal learning with limited communication.
problem Cooperative multi-agent reinforcement learning with function approximation.
method Careful message-passing and cooperative value iteration.
result Achieving near-optimal no-regret learning with limited communication in cooperative multi-agent settings.
In this paper we characterise the propensity of big capital investments to systematically deliver poor outcomes as "fragility," a notion suggested by Nassim Taleb. A thing or system that is easily harmed by randomness is fragile. We argue that, contrary to their appearance, big capital investments break easily - i.e. d…
Generative and reproducible benchmarks for comprehensive evaluation of machine learning classifierscs.LG
DIGEN benchmark provides synthetic datasets for ML algorithm evaluation.
problem Understanding and comparing machine learning algorithms' performance.
method Synthetic datasets generated using 40 mathematical functions to evaluate machine learning algorithms.
result DIGEN resource facilitates understanding why algorithms perform poorly and provides ideas for improvement.
SaML guides ML models to avoid survey biases.
problem ML models trained on survey data often ignore survey design metadata.
method Nine-step guideline for incorporating survey design metadata in ML lifecycle.
result SaML provides valid population inference from survey data.
AutoWS-Bench-101 evaluates automated weak supervision methods for diverse domains.
problem Limited applicability of weak supervision due to difficulty in designing labeling functions.
method Automates labeling function design using a small set of ground truth labels.
result AutoWS methods often require foundation models to outperform simple few-shot baselines.
We introduce a measure to quantify ambiguity in deep learning models, improving their reliability.
problem Deep learning models make mistakes on seemingly trivial cases and fail in recognizing what they don't know.
method We define ambiguity based on decision boundaries and convex hulls in feature space, developing a theoretical framework to identify unknowns.
result A single ambiguity measure can detect a significant portion of model mistakes, including adversarial and out-of-distribution inputs.
This summarizes the study of the financial and economic crisis in Europe. The starting questions were: 1) Why do we have a crisis? Unde venis? 2) What will be the outcome? Quo vadis? Here is the reasoning which touches many areas, ranging from financial to politics and from psychology and economy.
Offline Reinforcement Learning with Differentiable Function Approximation is Provably Efficientcs.LG
Efficient offline reinforcement learning with neural networks using differentiable function approximation.
problem Statistical efficiency of offline reinforcement learning with function approximators.
method Pessimistic fitted Q-learning (PFQL) and differentiable function approximation.
result Provably efficient offline reinforcement learning with differentiable function approximation.