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

134269403537 · Jun 202019922001200920172026
48 results for software effort estimation

Replication study shows Deep-SE still not as effective as previously thought for agile effort estimation.

problem Improving accuracy in estimating agile software development effort.
method Close replication of Deep-SE using additional data and comparison with multiple baselines.
result Deep-SE outperforms only a few cases, suggesting more work is needed.

Although there has been substantial research in software analytics for effort estimation in traditional software projects, little work has been done for estimation in agile projects, especially estimating user stories or issues. Story points are the most common unit of measure used for estimating the effort involved in…

2016-09-02abs ↗pdf ↗

Develops regression trees for estimating cumulative incidence curves in competing risks.

problem Estimating cumulative incidence functions in competing risks settings.
method Uses augmented estimators of the Brier score risk to build and prune regression trees.
result Demonstrates the utility of the proposed methods through simulation studies and real data.

Bayesian optimization reduces computational effort in aircraft design optimization.

problem High computational cost in industrial aircraft design optimization.
method Constrained Bayesian optimization (Super Efficient Global Optimization with Mixture of Experts)
result Significant computational efficiency improvements over existing Isight optimizers.

Software estimates inequality in random systems with changing communities.

problem Measuring inequality in systems with dynamic interactions and random attributes.
method Piecewise homogeneous Markov chain for changing points, copula function for multivariate distribution, Monte Carlo algorithm for entropy estimation.
result Estimates Random Theil's Entropy to measure inequality in random systems.

We use a control framework to analyze the digital vendor's profit maximization problem. The vendor captures market share by focusing costly effort on post-launch product maintenance, which influences user perception of the product and drives a revenue stream associated with product use. Our theoretical results show nec…

2014-12-30abs ↗pdf ↗

Model predicts customer churn in financial institutions using neural networks.

problem Manual feature engineering in customer churn prediction.
method Developed a Multi-layer Perceptron model using Artificial Neural Network architecture.
result Artificial Neural Network model achieved comparable performance to Neuro Solution Infinity software.

ease.ml/ci integrates machine learning models rigorously with minimal labeling effort.

problem Lack of rigorous continuous integration for machine learning models.
method Design of a domain-specific language and novel optimizations to reduce labeling effort.
result Achieved single accuracy point error tolerance with 0.999 reliability using minimal labeling effort.

The paper proposes using non-isotropic distances for more accurate trace link recommendation.

problem Time-consuming and error-prone creation and maintenance of trace links.
method Geometric viewpoint on semantic similarity using non-linear similarity measures.
result Non-isotropic distances improve trace link recommendation accuracy.

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.

Paper proposes a faster method for evaluating DNN hardware and software designs.

problem Reducing time for evaluating different DNN hardware and software designs.
method Using virtual hardware models to estimate DNN performance at the concept phase.
result Up to 92% accuracy in predicting DNN inference processing time.

funcGNN uses graph neural networks to estimate program similarity efficiently.

problem Estimating accurate program similarity for software engineering tasks.
method funcGNN trains on labeled CFG pairs to predict GED between unseen programs using effective embedding vectors.
result funcGNN achieves lower error rate (0.00194) and is 23 times faster than traditional methods.

AI platforms disrupt investment by personalizing deal sourcing and insights.

problem Lack of scalable, personalized, and privacy-compliant deal sourcing and insights solutions.
method Development of in-house AI platforms that interact directly with funds and learn from interactions.
result AI platforms provide smarter, personalized use cases for funds, offering a competitive advantage.

Adaptive Bernstein copulas improve risk management by preventing overfitting and reducing simulation effort.

problem Overfitting and high simulation effort in estimating dependence models.
method Constructive approach to Bernstein copulas with an admissible discrete skeleton.
result Comparison of different copula approaches in risk management shows improved accuracy and efficiency.

New method to estimate doctors' effort in annotating medical images.

problem High effort and expense in annotating medical images.
method Proposes a new criterion to evaluate effort, uses active learning and U-shape network for annotation strategy, and fine annotation platform to reduce effort.
result State-of-the-art segmentation performance achieved with only 60% annotation candidates, reducing effort by 44-47%.

Paper proposes a new Markov model for efficient PLC system design.

problem Efficient estimation of Markov model parameters for bursty error channels.
method Introduced a Block Diagonal Markov model and a modified Baum-Welch algorithm.
result Efficient estimation of state transition matrix ΛΛ for PLC system design.

PyKEEN 1.0 simplifies KGE model creation and optimization.

problem Training and evaluating knowledge graph embeddings (KGEs).
method Composes KGEMs with various interaction models, training approaches, and loss functions. Implements automatic memory optimization and extensive HPO functionalities.
result PyKEEN 1.0 streamlines KGE model creation and optimization.

BoXHED boosts hazard estimation for dynamic health risk scores.

problem Analyzing time-varying health vitals for disease onset prediction.
method Gradient boosting for nonparametric hazard function estimation with time-dependent covariates.
result Novel interaction effects among risk factors identified in cardiovascular disease onset data.

Lie-Butcher (LB) series are formal power series expressed in terms of trees and forests. On the geometric side LB-series generalizes classical B-series from Euclidean spaces to Lie groups and homogeneous manifolds. On the algebraic side, B-series are based on pre-Lie algebras and the Butcher-Connes-Kreimer Hopf algebra…

2017-01-13abs ↗pdf ↗

Uncertainty computation in deep learning is essential to design robust and reliable systems. Variational inference (VI) is a promising approach for such computation, but requires more effort to implement and execute compared to maximum-likelihood methods. In this paper, we propose new natural-gradient algorithms to red…

2018-06-13abs ↗pdf ↗

Research proposes an ensemble learning model for efficient software defect prediction.

problem Efficient and cost-effective software testing to minimize project resources.
method Machine learning analysis on different datasets using KNN, Decision Tree, SVM, and Naïve Bayes.
result Ensemble learning model outperforms other techniques in accuracy, precision, recall, and F1-score.

Improving software quality through effective organizational learning.

problem Lack of reliable quantification methods for software evolution.
method Leveraging application lifecycle management data to identify and address managerial practices.
result Effective learning from past processes improves software quality indirectly.

reval package selects best clustering solutions via stability-based validation.

problem Challenges in determining best clustering solutions due to lack of validation methods.
method Stability-based relative clustering validation methods.
result Determines best clustering solutions that generalize to unseen data.

Improved software flaw detection using NAS on multimodal DL models.

problem Software flaw detection in multimodal deep learning models.
method Adapted NAS framework for multimodal learning, combined with multimodal deep learning models.
result Improved performance on the Juliet Test Suite.

Method predicts hardware resource usage by control software with guaranteed linear convergence.

problem Predicting time-varying hardware resource availability in control software.
method Path structured multimarginal Schrödinger bridge (MSBP) for learning stochastic resource usage.
result Guaranteed linear convergence to accurate prediction of hardware resource utilization.

The paper introduces tools for nonparametric conditional density estimation in astronomy.

problem Estimating photometric redshifts and likelihood-free cosmological inference with uncertainty quantification.
method Nonparametric conditional density estimation (CDE) tools in Python and R.
result Comprehensive statistical tools and software for CDE in astronomy.

Unified R packages for forecast reconciliation of constrained series.

problem Improving accuracy and coherence of forecasts for linearly constrained multiple time series.
method Classical and machine learning-based linear reconciliation approaches for cross-sectional, temporal, and cross-temporal frameworks.
result Unified toolbox for forecast reconciliation in R.