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

Trend · papers per month

1223 · Jul 201919922001200920172026
18 results for Sydney

Spatial ABM predicts housing market trends in Sydney.

problem Inadequate spatial modeling in housing market forecasts.
method Graph-based spatial agent-based model incorporating social and economic factors.
result Model accurately predicts market trends and local area-specific forecasts.

The paper uses graph learning to detect valid instruments in high-dimensional data for house pricing.

problem Endogeneity bias and invalid instrument validation in high-dimensional data.
method Merge variable selection algorithms and probabilistic graphs to estimate house prices and causal structure.
result Efficient data-driven instrument selection and invalid instrument purge in high-dimensional data.

Study estimates and predicts dynamic traffic OD flows for improved DTA models.

problem Estimating and predicting time-varying OD trip tables for dynamic traffic assignment.
method Bi-level optimisation for OD flow estimation and time series prediction for OD demand.
result High capability of proposed OD demand estimation method to reduce DTA model error.

Model explains herding and volatility in urban housing prices.

problem Understanding non-linear price dynamics in urban housing markets.
method Agent-based model with rational households and trend-following behavior.
result Model accurately predicts price variability and herding behavior.

The study uses Gaussian mixture models to estimate pipe wall thickness from partial scans.

problem Estimating remaining wall thickness of critical water mains in non-destructive evaluation.
method Developed a robotic vehicle for pipe inspections. Used Gaussian Processes and Gaussian Mixture Models to infer RWT at unseen sections.
result Gaussian mixture models effectively capture the probability of RWT values in inspected data.

The paper tackles energy management in buildings with PCM using dynamic programming.

problem Optimal scheduling of HVAC systems in buildings with PCM is challenging due to nonlinear and non-convex characteristics.
method The paper uses dynamic programming to address the nonlinear nature of PCM, incorporating macro actions and multi-time scale Markov decision processes to reduce computational burden.
result The proposed method demonstrates a computational speed-up of up to 12,900 times compared to direct DP application.

Proposes a multi-objective variational autoencoder for smart infrastructure damage detection.

problem Detecting and diagnosing damage in smart infrastructure using multi-way data.
method Multi-objective variational autoencoder (MVA) method for smart infrastructure damage detection and diagnosis.
result The method accurately detects structural damage, estimates severity, and captures damage locations.

Machine learning models predict bluebottles' presence on beaches, addressing class imbalance and unreliable absence data.

problem Predicting bluebottles' presence on beaches with machine learning, tackling class imbalance and unreliable absence data.
method Used Multilayer Perceptron, Random Forest, and XGBoost models; employed data augmentation techniques like SMOTE, Random Undersampling, and Synthetic Negative Approach.
result Random Forests combined with Synthetic Negative Approach provided the best predictive model, identifying wind direction as a key factor.

Solar improves variable selection in high-dimensional data with complicated dependence structures.

problem Variable selection in ultrahigh dimensional data with severe multicollinearity and grouping effect issues.
method Subsample-ordered least angle regression (Solar) for ultrahigh dimensional data.
result Solar yields substantial improvements in sparsity, stability, and accuracy of variable selection compared to traditional methods.

Adaptive multiple kernel learning predicts railway points failures.

problem Predicting failures of railway points to minimize negative effects.
method Formulated as multiple kernel learning problem, robust algorithm considers missing data and point variance.
result Superior performance compared to state-of-the-art methods.